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 4, 2026 05:38Victor MerckléVictor MerckléScore: 2,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 05:392,91332,046,89222,855,0001,039,0002,117,632stderr
2Jul 4, 2026 05:392,92231,910,62322,817,0001,151,0002,117,632stderr
3Jul 4, 2026 05:392,93131,860,29922,921,0001,114,0002,117,632stderr
4Jul 4, 2026 05:392,93331,988,25023,038,0001,018,0002,117,632stderr
5Jul 4, 2026 05:392,95031,952,19823,060,0001,130,0002,117,632stderr
6Jul 4, 2026 05:392,95032,088,33823,137,0001,058,0002,117,632stderr
7Jul 4, 2026 05:392,96232,091,33623,120,0001,172,0002,117,632stderr
8Jul 4, 2026 05:392,96832,205,35223,149,0001,192,0002,117,632stderr
9Jul 4, 2026 05:393,06832,929,47623,999,0001,165,0002,117,632stderr