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 11:46Victor MerckléVictor MerckléScore: 2,634Success
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 11:472,55329,393,83620,942,000024,576stderr
2Sep 8, 2026 11:472,58529,540,10420,184,0001,019,00024,576stderr
3Sep 8, 2026 11:472,58829,633,05821,228,000024,576stderr
4Sep 8, 2026 11:472,60529,627,14121,366,000024,576stderr
5Sep 8, 2026 11:472,63430,614,42621,604,000024,576stderr
6Sep 8, 2026 11:472,64034,073,39021,652,000024,576stderr
7Sep 8, 2026 11:472,64130,746,66421,661,000024,576stderr
8Sep 8, 2026 11:472,64730,073,13321,709,000024,576stderr
9Sep 8, 2026 11:472,64930,763,06021,722,000024,576stderr