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 listJun 6, 2026 01:19Victor MerckléVictor MerckléScore: 3,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 01:203,36236,724,86526,520,0001,053,0002,113,536
2Jun 6, 2026 01:203,37036,741,06526,582,0001,052,0002,113,536
3Jun 6, 2026 01:203,37236,794,11726,596,0001,060,0002,113,536
4Jun 6, 2026 01:203,39436,957,53826,795,0001,037,0002,113,536
5Jun 6, 2026 01:203,43137,251,63926,072,0002,067,0002,113,536
6Jun 6, 2026 01:203,43437,303,70026,116,0002,050,0002,113,536
7Jun 6, 2026 01:203,52738,125,36026,902,0002,024,0002,113,536
8Jun 6, 2026 01:2012,811114,179,245102,782,0002,273,0002,113,536
9Jun 6, 2026 01:2013,681121,269,240110,153,0002,033,0002,113,536