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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 11:492,97232,681,46023,349,0001,023,0002,117,632stderr
2Jul 3, 2026 11:492,98932,472,42923,480,0001,033,0002,117,632stderr
3Jul 3, 2026 11:493,00132,533,74823,572,0001,043,0002,117,632stderr
4Jul 3, 2026 11:493,01132,595,21723,543,0001,152,0002,117,632stderr
5Jul 3, 2026 11:493,02532,746,96123,776,0001,033,0002,117,632stderr
6Jul 3, 2026 11:493,05233,030,09423,871,0001,157,0002,117,632stderr
7Jul 3, 2026 11:4911,825105,245,35995,820,0001,150,0002,117,632stderr
8Jul 3, 2026 11:4911,878105,281,31196,270,0001,134,0002,117,632stderr
9Jul 3, 2026 11:4912,540110,706,646101,712,0001,124,0002,117,632stderr