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 listSep 3, 2026 22:23Josu San MartinJosu San MartinScore: 3,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:243,25536,687,11725,671,0001,020,0002,121,728stderr
2Sep 3, 2026 22:243,25736,648,63225,678,0001,033,0002,121,728stderr
3Sep 3, 2026 22:243,27736,897,82125,845,0001,028,0002,121,728stderr
4Sep 3, 2026 22:243,28037,643,23525,878,0001,026,0002,121,728stderr
5Sep 3, 2026 22:243,29337,685,75825,965,0001,039,0002,121,728stderr
6Sep 3, 2026 22:243,29640,545,27126,001,0001,031,0002,121,728stderr
7Sep 3, 2026 22:243,29837,004,06726,012,0001,033,0002,121,728stderr
8Sep 3, 2026 22:243,29837,062,12426,010,0001,038,0002,121,728stderr
9Sep 3, 2026 22:243,30237,019,95826,052,0001,027,0002,121,728stderr