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 listAug 23, 2026 19:12Victor MerckléVictor MerckléScore: 5,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:132,83431,591,90622,226,0001,014,0002,117,632stderr
2Aug 23, 2026 19:132,84131,616,76922,291,0001,011,0002,117,632stderr
3Aug 23, 2026 19:132,84531,693,63322,165,0001,172,0002,117,632stderr
4Aug 23, 2026 19:132,89239,761,82122,673,0001,049,0002,117,632stderr
5Aug 23, 2026 19:135,44452,931,25343,614,0001,033,0002,117,632stderr
6Aug 23, 2026 19:135,45053,009,95043,650,0001,047,0002,117,632stderr
7Aug 23, 2026 19:135,46253,114,43543,755,0001,040,0002,117,632stderr
8Aug 23, 2026 19:135,49053,966,32543,899,0001,124,0002,117,632stderr
9Aug 23, 2026 19:135,50853,445,81044,157,0001,013,0002,117,632stderr