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 listMay 3, 2026 13:43TudyMTudyMScore: 17,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 13:4416,968154,937,603137,982,0001,158,0002,355,200
2May 3, 2026 13:4416,977154,889,469137,992,0001,224,0002,371,584
3May 3, 2026 13:4416,989158,598,850138,069,0001,243,0002,371,584
4May 3, 2026 13:4416,995152,837,686138,150,0001,217,0002,367,488
5May 3, 2026 13:4417,006159,463,263138,184,0001,266,0002,379,776
6May 3, 2026 13:4417,009155,347,380138,338,0001,140,0002,351,104
7May 3, 2026 13:4417,030157,809,694138,405,0001,243,0002,363,392
8May 3, 2026 13:4417,054154,129,303138,600,0001,246,0002,371,584
9May 3, 2026 13:4417,148156,630,832139,394,0001,223,0002,367,488