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 19, 2026 18:17Andrew EpsteinAndrew EpsteinScore: 31,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:1828,142241,884,586228,696,0002,074,0002,121,728stderr
2Sep 19, 2026 18:1831,203278,419,523253,784,0002,088,0002,121,728stderr
3Sep 19, 2026 18:1831,480269,237,292256,062,0002,078,0002,121,728stderr
4Sep 19, 2026 18:1831,540269,620,889256,617,0002,011,0002,121,728stderr
5Sep 19, 2026 18:1831,560269,927,201256,787,0002,013,0002,121,728stderr
6Sep 19, 2026 18:1831,564269,208,570256,810,0002,022,0002,121,728stderr
7Sep 19, 2026 18:1831,575269,557,945256,815,0002,100,0002,121,728stderr
8Sep 19, 2026 18:1831,720271,855,419258,045,0002,063,0002,121,728stderr
9Sep 19, 2026 18:1832,365275,810,209263,302,0002,093,0002,121,728stderr