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 10:33Victor MerckléVictor MerckléScore: 2,599Success
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 10:342,58629,436,89221,211,000024,576stderr
2Sep 8, 2026 10:342,59029,446,40121,245,000024,576stderr
3Sep 8, 2026 10:342,59629,681,78821,294,000024,576stderr
4Sep 8, 2026 10:342,59629,644,25821,295,000024,576stderr
5Sep 8, 2026 10:342,59929,731,43121,315,000024,576stderr
6Sep 8, 2026 10:342,59929,501,95221,318,000024,576stderr
7Sep 8, 2026 10:342,60329,737,07221,352,000024,576stderr
8Sep 8, 2026 10:342,60329,722,63621,352,000024,576stderr
9Sep 8, 2026 10:345,32751,940,93342,668,0001,015,00024,576stderr