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 11:51Victor MerckléVictor MerckléScore: 2,938Success
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 11:512,86331,441,07722,446,0001,035,0002,117,632stderr
2Jul 7, 2026 11:512,87931,651,08422,583,0001,025,0002,117,632stderr
3Jul 7, 2026 11:512,90331,965,96822,761,0001,048,0002,117,632stderr
4Jul 7, 2026 11:512,91031,838,17522,833,0001,033,0002,117,632stderr
5Jul 7, 2026 11:512,93832,484,78823,060,0001,034,0002,117,632stderr
6Jul 7, 2026 11:512,95932,725,85823,219,0001,049,0002,117,632stderr
7Jul 7, 2026 11:5111,629103,375,68694,315,0001,048,0002,117,632stderr
8Jul 7, 2026 11:5111,679103,752,96094,656,0001,118,0002,117,632stderr
9Jul 7, 2026 11:5111,795104,673,03095,658,0001,065,0002,117,632stderr