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 listJul 9, 2026 07:15Victor MerckléVictor MerckléScore: 2,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 07:162,85531,430,43122,378,0001,033,0002,117,632stderr
2Jul 9, 2026 07:162,88131,637,83322,507,0001,122,0002,117,632stderr
3Jul 9, 2026 07:162,88231,641,65822,504,0001,136,0002,117,632stderr
4Jul 9, 2026 07:162,88431,700,05922,541,0001,110,0002,117,632stderr
5Jul 9, 2026 07:162,91131,959,85522,813,0001,058,0002,117,632stderr
6Jul 9, 2026 07:162,99832,595,36523,558,0001,027,0002,117,632stderr
7Jul 9, 2026 07:1611,691103,894,73194,826,0001,045,0002,117,632stderr
8Jul 9, 2026 07:1611,752104,377,00695,337,0001,031,0002,117,632stderr
9Jul 9, 2026 07:1612,324109,056,473100,034,0001,030,0002,117,632stderr