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 31, 2026 16:20Victor MerckléVictor MerckléScore: 2,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 16:212,71230,625,76421,145,0001,095,0002,117,632stderr
2Aug 31, 2026 16:212,72830,679,68021,289,0001,081,0002,117,632stderr
3Aug 31, 2026 16:212,74430,944,59121,481,0001,021,0002,117,632stderr
4Aug 31, 2026 16:212,75030,911,61421,509,0001,045,0002,117,632stderr
5Aug 31, 2026 16:212,75030,957,87821,427,0001,129,0002,117,632stderr
6Aug 31, 2026 16:212,75130,942,16221,530,0001,034,0002,117,632stderr
7Aug 31, 2026 16:212,75430,704,92621,478,0001,112,0002,117,632stderr
8Aug 31, 2026 16:215,37452,422,74243,045,0001,027,0002,117,632stderr
9Aug 31, 2026 16:215,41952,767,90943,401,0001,037,0002,117,632stderr