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 listSep 1, 2026 13:25Victor MerckléVictor MerckléScore: 2,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 13:262,62929,988,11820,530,0001,031,0002,117,632stderr
2Sep 1, 2026 13:262,63030,589,90720,539,0001,029,0002,117,632stderr
3Sep 1, 2026 13:262,63429,839,96520,556,0001,043,0002,117,632stderr
4Sep 1, 2026 13:262,63629,995,53820,596,0001,024,0002,117,632stderr
5Sep 1, 2026 13:262,64030,075,54220,620,0001,028,0002,117,632stderr
6Sep 1, 2026 13:265,28751,548,15042,088,0001,272,0002,117,632stderr
7Sep 1, 2026 13:265,28851,762,79342,131,0001,238,0002,117,632stderr
8Sep 1, 2026 13:265,33752,127,84642,498,0001,269,0002,117,632stderr
9Sep 1, 2026 13:265,49153,435,06544,012,0001,018,0002,117,632stderr