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 listJul 7, 2026 12:54Victor MerckléVictor MerckléScore: 2,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:562,87631,500,42522,478,0001,107,0002,117,632stderr
2Jul 7, 2026 12:562,88831,694,92722,670,0001,016,0002,117,632stderr
3Jul 7, 2026 12:562,91731,874,39922,803,0001,123,0002,117,632stderr
4Jul 7, 2026 12:562,92532,026,80022,955,0001,033,0002,117,632stderr
5Jul 7, 2026 12:562,95732,187,60123,149,0001,106,0002,117,632stderr
6Jul 7, 2026 12:563,06233,399,61823,895,0001,215,0002,117,632stderr
7Jul 7, 2026 12:5611,707104,467,60494,840,0001,165,0002,117,632stderr
8Jul 7, 2026 12:5612,273111,489,65399,467,0001,174,0002,117,632stderr
9Jul 7, 2026 12:5612,426109,903,709100,799,0001,095,0002,117,632stderr