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 listApr 25, 2026 19:46Charles CabergsCharles CabergsScore: 4,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 19:464,71854,454,33236,653,0002,036,0002,342,912
2Apr 25, 2026 19:464,72152,145,53937,726,000992,0002,355,200
3Apr 25, 2026 19:464,73156,705,77634,818,0003,979,0002,355,200
4Apr 25, 2026 19:464,73558,581,06036,842,0001,991,0002,371,584
5Apr 25, 2026 19:464,73962,309,92436,873,0001,993,0002,338,816
6Apr 25, 2026 19:464,74857,109,96035,942,0002,995,0002,359,296
7Apr 25, 2026 19:469,670103,148,09077,292,0002,007,0002,363,392
8Apr 25, 2026 19:469,77094,612,71176,114,0004,006,0002,527,232
9Apr 25, 2026 19:469,80894,080,53277,417,0003,016,0002,322,432