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 3, 2026 17:49Josu San MartinJosu San MartinScore: 3,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:503,21836,447,70525,101,0001,290,0002,117,632
2Sep 3, 2026 17:503,24636,620,97025,593,0001,029,0002,117,632
3Sep 3, 2026 17:503,24836,514,44425,345,0001,289,0002,117,632
4Sep 3, 2026 17:503,25136,745,90425,631,0001,029,0002,117,632
5Sep 3, 2026 17:503,25936,663,63525,697,0001,033,0002,117,632
6Sep 3, 2026 17:5015,335135,718,167124,737,0001,010,0002,117,632
7Sep 3, 2026 17:5015,343137,232,445124,800,0001,013,0002,117,632
8Sep 3, 2026 17:5015,369135,956,165125,019,0001,009,0002,117,632
9Sep 3, 2026 17:5015,432138,222,588125,481,0001,067,0002,117,632