Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJul 1, 2026 05:12Victor MerckléVictor MerckléScore: 3,125Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 05:133,09333,631,40824,186,0001,182,0002,117,632stderr
2Jul 1, 2026 05:133,09833,340,64424,240,0001,169,0002,117,632stderr
3Jul 1, 2026 05:133,10233,294,57724,277,0001,167,0002,117,632stderr
4Jul 1, 2026 05:133,10733,458,08124,254,0001,228,0002,117,632stderr
5Jul 1, 2026 05:133,12533,521,71624,453,0001,175,0002,117,632stderr
6Jul 1, 2026 05:133,12933,490,03324,496,0001,165,0002,117,632stderr
7Jul 1, 2026 05:133,13833,962,84624,583,0001,150,0002,117,632stderr
8Jul 1, 2026 05:1312,090107,062,26698,129,0001,009,0002,117,632stderr
9Jul 1, 2026 05:1312,745112,387,696103,500,0001,009,0002,117,632stderr