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 23, 2026 21:19Victor MerckléVictor MerckléScore: 3,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 21:203,03832,543,13223,719,0001,199,0002,113,536
2Jun 23, 2026 21:203,04332,625,16123,756,0001,198,0002,113,536
3Jun 23, 2026 21:203,04732,704,91223,747,0001,246,0002,113,536
4Jun 23, 2026 21:203,06032,729,46623,912,0001,187,0002,113,536
5Jun 23, 2026 21:203,08032,938,59124,054,0001,207,0002,113,536
6Jun 23, 2026 21:203,08634,545,17124,093,0001,219,0002,113,536
7Jun 23, 2026 21:203,10933,384,88124,274,0001,224,0002,113,536
8Jun 23, 2026 21:2012,027106,236,76997,612,0001,011,0002,113,536
9Jun 23, 2026 21:2012,047106,443,64597,779,0001,010,0002,113,536