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 19, 2026 14:38Victor MerckléVictor MerckléScore: 2,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 14:392,81431,219,53722,011,0001,064,0002,117,632stderr
2Aug 19, 2026 14:392,83731,569,46122,203,0001,067,0002,117,632stderr
3Aug 19, 2026 14:392,84131,668,59322,103,0001,198,0002,117,632stderr
4Aug 19, 2026 14:392,84232,189,33822,125,0001,180,0002,117,632stderr
5Aug 19, 2026 14:392,86732,360,58322,487,0001,026,0002,117,632stderr
6Aug 19, 2026 14:392,88131,963,35522,608,0001,024,0002,117,632stderr
7Aug 19, 2026 14:395,53453,562,92744,350,0001,034,0002,117,632stderr
8Aug 19, 2026 14:395,57154,193,62244,667,0001,020,0002,117,632stderr
9Aug 19, 2026 14:395,60254,110,52944,919,0001,022,0002,117,632stderr