Skip to content

Instantly share code, notes, and snippets.

View c-rack's full-sized avatar
🎯
Focusing

Constantin Rack c-rack

🎯
Focusing
View GitHub Profile
@c-rack
c-rack / gist:38b9f5ef5a4fc6a8725b
Created September 27, 2015 21:36
erlang.mk make -k check output as of 2015-09-27 on OS X 10.7.5
➜ erlang.mk git:(master) make check -k
make -C test LEGACY=
build: Generate a bleeding edge Erlang.mk
core-app-asn1: Bootstrap a new OTP library named core_app_asn1
core-app-asn1: Download .asn1 files from Erlang/OTP
core-app-asn1: Generate .erl files dependent from headers generated by .asn1 files
core-app-asn1: Generate an unrelated .hrl file
core-app-asn1: Build the application
core-app-asn1: Check that all compiled files exist
core-app-asn1: Check that the application was compiled correctly
@c-rack
c-rack / gist:b6455ae35a387db011f5
Created September 25, 2015 17:21
Erlang.mk make -k check output on OS X 10.7.5
make -C test LEGACY=
uname: illegal option -- o
usage: uname [-amnprsv]
build: Generate a bleeding edge Erlang.mk
core-app-asn1: Bootstrap a new OTP library named core_app_asn1
core-app-asn1: Download .asn1 files from Erlang/OTP
core-app-asn1: Generate .erl files dependent from headers generated by .asn1 files
core-app-asn1: Generate an unrelated .hrl file
core-app-asn1: Build the application
core-app-asn1: Check that all compiled files exist

Keybase proof

I hereby claim:

  • I am c-rack on github.
  • I am constantin (https://keybase.io/constantin) on keybase.
  • I have a public key whose fingerprint is 1BC8 6444 BBD2 A24C 3A40 904A 438E 9634 A231 9637

To claim this, I am signing this object:

Here's the assignment:

Download this raw statistics dump from Wikipedia (360mb unzipped):

http://dumps.wikimedia.org/other/pagecounts-raw/2014/2014-10/pagecounts-20141029-230000.gz

Write a simple script in your favourite programming language that:

  • Gets all views from the English Wikipedia (these are prefixed by "en ")
  • Limit those articles to the ones with at least 500 views
  • Sort by number of views, highest ones first and print the first ten articles.