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:04Victor MerckléVictor MerckléScore: 2,637Success
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:052,62129,844,59720,440,0001,060,0002,117,632stderr
2Sep 1, 2026 14:052,62429,913,20120,500,0001,022,0002,117,632stderr
3Sep 1, 2026 14:052,62730,064,42820,519,0001,027,0002,117,632stderr
4Sep 1, 2026 14:052,62829,893,02820,534,0001,022,0002,117,632stderr
5Sep 1, 2026 14:052,63729,940,20320,606,0001,024,0002,117,632stderr
6Sep 1, 2026 14:052,64230,339,38720,532,0001,137,0002,117,632stderr
7Sep 1, 2026 14:055,27751,601,87642,117,0001,162,0002,117,632stderr
8Sep 1, 2026 14:055,30252,040,73542,215,0001,267,0002,117,632stderr
9Sep 1, 2026 14:055,31652,511,21642,332,0001,266,0002,117,632stderr