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:34Josu San MartinJosu San MartinScore: 3,052Success
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 00:513,02036,116,12423,744,0001,020,0002,121,728stderr
2Sep 5, 2026 00:513,04234,950,69223,922,0001,028,0002,121,728stderr
3Sep 5, 2026 00:513,04434,972,24823,942,0001,024,0002,121,728stderr
4Sep 5, 2026 00:513,04834,891,51223,969,0001,026,0002,121,728stderr
5Sep 5, 2026 00:513,05235,815,55324,004,0001,027,0002,121,728stderr
6Sep 5, 2026 00:513,05835,036,64924,046,0001,037,0002,121,728stderr
7Sep 5, 2026 00:5115,222134,787,371123,814,0001,012,0002,121,728stderr
8Sep 5, 2026 00:5115,264135,144,225124,156,0001,016,0002,121,728stderr
9Sep 5, 2026 00:5115,277135,977,587124,270,0001,006,0002,121,728stderr