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 4, 2026 06:59Josu San MartinJosu San MartinScore: 3,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:003,06135,093,37824,070,0001,036,0002,121,728stderr
2Sep 4, 2026 07:003,06635,073,67724,120,0001,022,0002,121,728stderr
3Sep 4, 2026 07:003,06935,102,13824,121,0001,049,0002,121,728stderr
4Sep 4, 2026 07:003,08235,975,46124,239,0001,038,0002,121,728stderr
5Sep 4, 2026 07:003,08936,030,56524,301,0001,030,0002,121,728stderr
6Sep 4, 2026 07:0015,263135,207,896124,155,0001,009,0002,121,728stderr
7Sep 4, 2026 07:0015,288135,488,215124,357,0001,007,0002,121,728stderr
8Sep 4, 2026 07:0015,308135,463,413124,525,0001,005,0002,121,728stderr
9Sep 4, 2026 07:0015,313136,295,010124,568,0001,005,0002,121,728stderr