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 8, 2026 12:48Victor MerckléVictor MerckléScore: 3,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:493,07933,265,17824,218,0001,037,0002,117,632stderr
2Jul 8, 2026 12:493,08833,349,78624,296,0001,030,0002,117,632stderr
3Jul 8, 2026 12:493,09333,373,77124,331,0001,032,0002,117,632stderr
4Jul 8, 2026 12:493,13533,711,23824,656,0001,059,0002,117,632stderr
5Jul 8, 2026 12:493,25734,761,51525,665,0001,046,0002,117,632stderr
6Jul 8, 2026 12:4911,749104,378,42595,334,0001,012,0002,117,632stderr
7Jul 8, 2026 12:4911,802104,834,42195,774,0001,006,0002,117,632stderr
8Jul 8, 2026 12:4911,825104,946,39895,963,0001,008,0002,117,632stderr
9Jul 8, 2026 12:4911,849105,542,06396,158,0001,008,0002,117,632stderr