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 9, 2026 07:33Victor MerckléVictor MerckléScore: 2,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 07:332,90131,757,44622,670,0001,120,0002,117,632stderr
2Jul 9, 2026 07:332,90531,784,39022,700,0001,127,0002,117,632stderr
3Jul 9, 2026 07:332,91231,908,83322,767,0001,114,0002,117,632stderr
4Jul 9, 2026 07:332,92432,415,77922,946,0001,035,0002,117,632stderr
5Jul 9, 2026 07:332,96832,359,83223,212,0001,130,0002,117,632stderr
6Jul 9, 2026 07:3311,668103,667,64194,608,0001,070,0002,117,632stderr
7Jul 9, 2026 07:3311,700103,902,79494,874,0001,073,0002,117,632stderr
8Jul 9, 2026 07:3311,725104,106,80295,065,0001,085,0002,117,632stderr
9Jul 9, 2026 07:3311,727104,221,75994,968,0001,199,0002,117,632stderr