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 03:33Victor MerckléVictor MerckléScore: 2,992Success
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 03:342,94232,023,11223,002,0001,125,0002,117,632stderr
2Jul 8, 2026 03:342,94332,032,15522,949,0001,191,0002,117,632stderr
3Jul 8, 2026 03:342,95432,358,85623,019,0001,208,0002,117,632stderr
4Jul 8, 2026 03:342,96432,179,60123,191,0001,115,0002,117,632stderr
5Jul 8, 2026 03:342,99232,444,12223,422,0001,119,0002,117,632stderr
6Jul 8, 2026 03:3411,833105,009,55296,027,0001,008,0002,117,632stderr
7Jul 8, 2026 03:3411,868105,372,22996,311,0001,009,0002,117,632stderr
8Jul 8, 2026 03:3411,946105,988,41496,951,0001,008,0002,117,632stderr
9Jul 8, 2026 03:3412,398109,942,288100,662,0001,008,0002,117,632stderr