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 15:57Victor MerckléVictor MerckléScore: 2,657Success
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 15:582,56929,265,71321,066,000024,576stderr
2Sep 8, 2026 15:582,57029,322,14520,071,0001,005,00024,576stderr
3Sep 8, 2026 15:582,64030,708,66921,649,000024,576stderr
4Sep 8, 2026 15:582,65730,320,25421,791,000024,576stderr
5Sep 8, 2026 15:582,65730,157,93520,762,0001,027,00024,576stderr
6Sep 8, 2026 15:582,66831,663,25521,884,000024,576stderr
7Sep 8, 2026 15:585,40652,671,78143,320,0001,013,00024,576stderr
8Sep 8, 2026 15:585,42852,802,66543,492,0001,021,00024,576stderr
9Sep 8, 2026 15:585,44252,950,58743,614,0001,016,00024,576stderr