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 listAug 19, 2026 16:02Victor MerckléVictor MerckléScore: 5,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 16:082,73830,568,83321,340,0001,112,0002,117,632stderr
2Aug 19, 2026 16:082,75830,779,22621,576,0001,040,0002,117,632stderr
3Aug 19, 2026 16:082,76030,841,04821,625,0001,012,0002,117,632stderr
4Aug 19, 2026 16:082,76230,873,92021,635,0001,019,0002,117,632stderr
5Aug 19, 2026 16:085,39552,495,94943,189,0001,053,0002,117,632stderr
6Aug 19, 2026 16:085,40252,483,39143,246,0001,056,0002,117,632stderr
7Aug 19, 2026 16:085,42352,746,58943,339,0001,133,0002,117,632stderr
8Aug 19, 2026 16:085,43052,695,05343,386,0001,146,0002,117,632stderr
9Aug 19, 2026 16:085,59764,233,92444,727,0001,170,0002,117,632stderr