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 20:24Josu San MartinJosu San MartinScore: 3,265Success
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 20:243,19937,553,52625,196,0001,040,0002,117,632
2Sep 3, 2026 20:243,20436,285,06925,237,0001,043,0002,117,632
3Sep 3, 2026 20:243,22736,433,79425,238,0001,224,0002,117,632
4Sep 3, 2026 20:243,25136,650,81425,610,0001,049,0002,117,632
5Sep 3, 2026 20:243,26536,802,87925,728,0001,053,0002,117,632
6Sep 3, 2026 20:2415,325136,946,020124,665,0001,008,0002,117,632
7Sep 3, 2026 20:2415,344135,774,484124,817,0001,005,0002,117,632
8Sep 3, 2026 20:2415,415136,296,759125,385,0001,018,0002,117,632
9Sep 3, 2026 20:2415,561137,702,697126,596,0001,006,0002,117,632