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:09TudyMTudyMScore: 17,053Success
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:0916,990155,387,165138,059,0001,264,0002,359,296
2May 3, 2026 14:0916,995155,218,242138,177,0001,182,0002,355,200
3May 3, 2026 14:0917,015159,344,012138,339,0001,185,0002,375,680
4May 3, 2026 14:0917,025157,641,938138,600,0001,008,0002,371,584
5May 3, 2026 14:0917,053154,586,740138,677,0001,158,0002,351,104
6May 3, 2026 14:0917,105156,573,040139,065,0001,201,0002,359,296
7May 3, 2026 14:0917,111159,781,242139,311,0001,006,0002,379,776
8May 3, 2026 14:0917,126154,320,516139,294,0001,147,0002,367,488
9May 3, 2026 14:0917,335156,090,180140,958,0001,197,0002,355,200