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:53Victor MerckléVictor MerckléScore: 5,278Success
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:542,62829,880,68020,495,0001,059,0002,117,632stderr
2Sep 1, 2026 12:542,63029,880,75120,514,0001,057,0002,117,632stderr
3Sep 1, 2026 12:542,64930,158,19820,578,0001,151,0002,117,632stderr
4Sep 1, 2026 12:542,65330,100,94020,667,0001,088,0002,117,632stderr
5Sep 1, 2026 12:545,27851,605,85242,104,0001,177,0002,117,632stderr
6Sep 1, 2026 12:545,27851,622,46342,135,0001,149,0002,117,632stderr
7Sep 1, 2026 12:545,28551,757,59842,079,0001,265,0002,117,632stderr
8Sep 1, 2026 12:545,43352,953,02143,533,0001,021,0002,117,632stderr
9Sep 1, 2026 12:5415,201133,029,177123,647,0001,008,0002,117,632stderr