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:43Victor MerckléVictor MerckléScore: 2,655Success
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:442,56229,578,71521,014,000024,576stderr
2Sep 8, 2026 19:442,56429,507,32621,028,000024,576stderr
3Sep 8, 2026 19:442,62930,071,80521,559,000024,576stderr
4Sep 8, 2026 19:442,63230,065,78021,586,000024,576stderr
5Sep 8, 2026 19:442,65530,941,09321,776,000024,576stderr
6Sep 8, 2026 19:442,66230,980,53620,804,0001,031,00024,576stderr
7Sep 8, 2026 19:445,48154,656,71543,932,0001,016,00024,576stderr
8Sep 8, 2026 19:445,51154,303,46944,178,0001,018,00024,576stderr
9Sep 8, 2026 19:445,55654,057,39744,554,0001,013,00024,576stderr