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 14:28Victor MerckléVictor MerckléScore: 2,643Success
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 14:292,62729,941,96320,520,0001,022,0002,117,632stderr
2Sep 1, 2026 14:292,63029,954,31120,466,0001,100,0002,117,632stderr
3Sep 1, 2026 14:292,63029,950,29920,552,0001,017,0002,117,632stderr
4Sep 1, 2026 14:292,63029,967,65120,558,0001,015,0002,117,632stderr
5Sep 1, 2026 14:292,64330,065,09620,646,0001,032,0002,117,632stderr
6Sep 1, 2026 14:295,36452,339,88142,969,0001,020,0002,117,632stderr
7Sep 1, 2026 14:295,40354,783,08843,285,0001,023,0002,117,632stderr
8Sep 1, 2026 14:295,41553,385,29343,388,0001,022,0002,117,632stderr
9Sep 1, 2026 14:295,45753,778,48343,727,0001,023,0002,117,632stderr