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 7, 2026 12:45Victor MerckléVictor MerckléScore: 12,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:462,90832,295,67122,829,0001,021,0002,117,632stderr
2Jul 7, 2026 12:462,92631,786,05222,963,0001,034,0002,117,632stderr
3Jul 7, 2026 12:462,95032,176,21423,142,0001,056,0002,117,632stderr
4Jul 7, 2026 12:463,05233,053,31823,946,0001,086,0002,117,632stderr
5Jul 7, 2026 12:4612,298109,031,03599,816,0001,031,0002,117,632stderr
6Jul 7, 2026 12:4612,303108,839,46699,761,0001,129,0002,117,632stderr
7Jul 7, 2026 12:4612,380109,481,374100,378,0001,139,0002,117,632stderr
8Jul 7, 2026 12:4612,431110,436,379100,928,0001,008,0002,117,632stderr
9Jul 7, 2026 12:4612,484110,391,309101,236,0001,137,0002,117,632stderr