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:01Victor MerckléVictor MerckléScore: 11,826Success
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:022,96732,300,39123,302,0001,035,0002,117,632stderr
2Jul 3, 2026 11:022,98232,331,26223,428,0001,026,0002,117,632stderr
3Jul 3, 2026 11:022,98432,361,22223,423,0001,049,0002,117,632stderr
4Jul 3, 2026 11:023,00432,542,96623,608,0001,030,0002,117,632stderr
5Jul 3, 2026 11:0211,826105,100,56595,860,0001,119,0002,117,632stderr
6Jul 3, 2026 11:0211,831104,878,06295,992,0001,026,0002,117,632stderr
7Jul 3, 2026 11:0211,887105,410,86596,323,0001,152,0002,117,632stderr
8Jul 3, 2026 11:0211,909105,585,83096,524,0001,131,0002,117,632stderr
9Jul 3, 2026 11:0211,910105,644,32096,536,0001,128,0002,117,632stderr