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 listMay 3, 2026 14:07TudyMTudyMScore: 17,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 14:0817,244157,532,759140,152,0001,252,0002,375,680
2May 3, 2026 14:0817,262160,704,638140,272,0001,277,0002,363,392
3May 3, 2026 14:0817,274158,740,557140,376,0001,272,0002,367,488
4May 3, 2026 14:0817,312157,165,260140,701,0001,265,0002,359,296
5May 3, 2026 14:0817,327160,186,215140,879,0001,204,0002,359,296
6May 3, 2026 14:0817,338156,748,221140,917,0001,260,0002,359,296
7May 3, 2026 14:0817,352157,445,654141,279,0001,011,0002,351,104
8May 3, 2026 14:0817,470159,188,442141,996,0001,264,0002,355,200
9May 3, 2026 14:0817,562160,897,341143,005,0001,006,0002,367,488