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:46TudyMTudyMScore: 17,056Success
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:4716,962154,950,118137,943,0001,150,0002,342,912
2May 3, 2026 13:4716,974157,904,826138,181,0001,007,0002,375,680
3May 3, 2026 13:4717,004154,856,586138,187,0001,250,0002,367,488
4May 3, 2026 13:4717,048156,165,135138,544,0001,256,0002,379,776
5May 3, 2026 13:4717,056154,417,283138,733,0001,129,0002,375,680
6May 3, 2026 13:4717,075155,056,972138,746,0001,276,0002,355,200
7May 3, 2026 13:4717,134156,735,601139,299,0001,206,0002,351,104
8May 3, 2026 13:4717,170155,268,130139,563,0001,235,0002,363,392
9May 3, 2026 13:4717,522158,746,101142,438,0001,246,0002,363,392