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 3, 2026 23:32Josu San MartinJosu San MartinScore: 3,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 23:333,06135,138,79724,058,0001,045,0002,121,728stderr
2Sep 3, 2026 23:333,07035,174,83224,152,0001,029,0002,121,728stderr
3Sep 3, 2026 23:333,07235,975,40524,153,0001,038,0002,121,728stderr
4Sep 3, 2026 23:333,07535,176,12524,172,0001,049,0002,121,728stderr
5Sep 3, 2026 23:333,07635,167,29324,193,0001,031,0002,121,728stderr
6Sep 3, 2026 23:333,08736,059,32224,283,0001,034,0002,121,728stderr
7Sep 3, 2026 23:333,09236,019,05524,332,0001,028,0002,121,728stderr
8Sep 3, 2026 23:333,11336,735,71924,499,0001,032,0002,121,728stderr
9Sep 3, 2026 23:3315,283136,127,738124,316,0001,011,0002,121,728stderr