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 22, 2026 22:37M-RochatM-RochatScore: 22,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 22:385,38855,366,43640,933,0003,251,0002,113,536
2May 22, 2026 22:385,40255,345,57841,143,0003,161,0002,113,536
3May 22, 2026 22:385,53054,562,83842,230,0003,118,0002,113,536
4May 22, 2026 22:3822,178195,127,177177,787,0004,080,0002,113,536
5May 22, 2026 22:3822,311192,281,523178,675,0004,282,0002,117,632
6May 22, 2026 22:3822,314192,253,533178,797,0004,185,0002,113,536
7May 22, 2026 22:3822,327193,402,170178,836,0004,247,0002,117,632
8May 22, 2026 22:3822,379194,998,620179,246,0004,267,0002,113,536
9May 22, 2026 22:3822,482195,317,726180,142,0004,214,0002,113,536