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 8, 2026 19:14Victor MerckléVictor MerckléScore: 2,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 19:152,55729,517,46820,969,000024,576stderr
2Sep 8, 2026 19:152,55929,541,09020,991,000024,576stderr
3Sep 8, 2026 19:152,57230,811,97520,088,0001,003,00024,576stderr
4Sep 8, 2026 19:152,58229,691,43921,175,000024,576stderr
5Sep 8, 2026 19:152,64730,776,35721,706,000024,576stderr
6Sep 8, 2026 19:152,65330,796,67621,755,000024,576stderr
7Sep 8, 2026 19:152,65830,306,69421,796,000024,576stderr
8Sep 8, 2026 19:152,68030,568,52320,936,0001,046,00024,576stderr
9Sep 8, 2026 19:1511,707104,492,53694,991,0001,007,00024,576stderr