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 18, 2026 21:25Andrew TsibinAndrew TsibinScore: 2,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 21:262,97834,082,02723,396,0001,028,0002,113,536
2Jul 18, 2026 21:262,98134,199,30223,377,0001,068,0002,113,536
3Jul 18, 2026 21:262,98634,717,29523,433,0001,058,0002,113,536
4Jul 18, 2026 21:262,98634,220,09523,435,0001,057,0002,113,536
5Jul 18, 2026 21:262,99434,156,65223,504,0001,048,0002,117,632
6Jul 18, 2026 21:262,99934,594,93823,556,0001,042,0002,113,536
7Jul 18, 2026 21:263,00034,257,17023,573,0001,029,0002,113,536
8Jul 18, 2026 21:263,00434,977,70023,567,0001,072,0002,113,536
9Jul 18, 2026 21:263,00934,378,15623,649,0001,032,0002,113,536