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:59Victor MerckléVictor MerckléScore: 2,962Success
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 13:002,86831,510,16122,491,0001,031,0002,117,632stderr
2Jul 7, 2026 13:002,86932,355,37522,503,0001,025,0002,117,632stderr
3Jul 7, 2026 13:002,93332,000,65023,027,0001,026,0002,117,632stderr
4Jul 7, 2026 13:002,95032,231,97023,082,0001,111,0002,117,632stderr
5Jul 7, 2026 13:002,96232,292,46523,128,0001,164,0002,117,632stderr
6Jul 7, 2026 13:002,96332,276,14423,124,0001,173,0002,117,632stderr
7Jul 7, 2026 13:0011,674103,723,43394,478,0001,250,0002,117,632stderr
8Jul 7, 2026 13:0011,760104,442,49295,171,0001,262,0002,117,632stderr
9Jul 7, 2026 13:0011,928106,079,87295,809,0002,005,0002,117,632stderr