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 listApr 23, 2026 03:14olliecrowolliecrowScore: 3,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 03:143,28545,678,15024,945,0001,995,0002,551,808
2Apr 23, 2026 03:143,29144,961,88324,992,0001,999,0002,334,720
3Apr 23, 2026 03:143,30344,311,13725,086,0002,006,0002,547,712
4Apr 23, 2026 03:143,33145,546,92226,311,0001,011,0002,449,408
5Apr 23, 2026 03:143,36139,336,23825,523,0002,041,0002,420,736
6Apr 23, 2026 03:1423,759209,395,635191,828,0002,997,0002,416,640
7Apr 23, 2026 03:1423,800217,528,684193,165,0002,001,0002,494,464
8Apr 23, 2026 03:1423,813213,759,532193,265,0002,002,0002,494,464
9Apr 23, 2026 03:1423,855212,262,474192,622,0002,994,0002,506,752