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 listJan 18, 2026 16:15Josu San MartinJosu San MartinScore: 8,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 07:108,05091,275,49164,011,0002,000,0002,469,888
2Jan 18, 2026 16:158,06789,442,16664,146,0002,004,0002,514,944
3Jan 18, 2026 07:108,06988,989,45463,161,0003,007,0002,498,560
4Jan 18, 2026 16:158,08388,999,24465,277,0001,004,0002,514,944
5Jan 18, 2026 07:108,08790,194,19466,317,00002,363,392
6Jan 18, 2026 16:158,19191,739,91964,163,0003,007,0002,494,464