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 12:29Victor MerckléVictor MerckléScore: 2,843Success
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 12:302,82131,264,00322,002,0001,134,0002,117,632stderr
2Sep 1, 2026 12:302,82431,485,65822,095,0001,064,0002,117,632stderr
3Sep 1, 2026 12:302,82531,566,87822,064,0001,103,0002,117,632stderr
4Sep 1, 2026 12:302,83432,229,36422,177,0001,062,0002,117,632stderr
5Sep 1, 2026 12:302,84331,430,57422,232,0001,085,0002,117,632stderr
6Sep 1, 2026 12:302,84731,647,10722,178,0001,172,0002,117,632stderr
7Sep 1, 2026 12:305,51153,485,15344,179,0001,014,0002,117,632stderr
8Sep 1, 2026 12:305,52153,543,44544,262,0001,017,0002,117,632stderr
9Sep 1, 2026 12:305,52553,487,34144,291,0001,020,0002,117,632stderr