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 5, 2026 00:44Josu San MartinJosu San MartinScore: 3,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 01:173,02834,888,56023,807,0001,027,0002,121,728stderr
2Sep 5, 2026 01:173,05235,780,24023,998,0001,031,0002,121,728stderr
3Sep 5, 2026 01:173,06135,069,67024,081,0001,025,0002,121,728stderr
4Sep 5, 2026 01:173,06835,142,71024,112,0001,046,0002,121,728stderr
5Sep 5, 2026 01:173,16636,645,20324,944,0001,024,0002,121,728stderr
6Sep 5, 2026 01:1715,243135,688,506123,961,0001,034,0002,121,728stderr
7Sep 5, 2026 01:1715,275137,569,791124,251,0001,006,0002,121,728stderr
8Sep 5, 2026 01:1715,292135,370,712124,390,0001,005,0002,121,728stderr
9Sep 5, 2026 01:1715,305136,508,889124,493,0001,012,0002,121,728stderr