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 17, 2026 08:29M-RochatM-RochatScore: 22,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:3010,10491,697,98176,635,0006,224,0002,113,536
2May 17, 2026 08:3010,17193,858,44176,879,0006,531,0002,113,536
3May 17, 2026 08:3010,35393,664,67978,544,0006,352,0002,113,536
4May 17, 2026 08:3010,44294,869,90379,136,0006,496,0002,113,536
5May 17, 2026 08:3022,341191,942,438175,669,0007,528,0002,113,536
6May 17, 2026 08:3022,375192,248,268175,949,0007,526,0002,113,536
7May 17, 2026 08:3022,422192,704,686176,363,0007,499,0002,113,536
8May 17, 2026 08:3022,423194,536,681176,472,0007,403,0002,117,632
9May 17, 2026 08:3022,589194,094,070177,987,0007,250,0002,113,536