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 listSep 8, 2026 06:08Victor MerckléVictor MerckléScore: 2,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 06:092,59129,986,07821,249,000024,576stderr
2Sep 8, 2026 06:092,59430,436,40321,278,000024,576stderr
3Sep 8, 2026 06:092,59830,048,68021,311,000024,576stderr
4Sep 8, 2026 06:092,59929,524,18421,312,000024,576stderr
5Sep 8, 2026 06:092,60629,856,17221,375,000024,576stderr
6Sep 8, 2026 06:092,61029,895,51121,403,000024,576stderr
7Sep 8, 2026 06:092,61129,861,71521,415,000024,576stderr
8Sep 8, 2026 06:095,28852,582,47542,345,0001,024,00024,576stderr
9Sep 8, 2026 06:095,29052,559,89842,376,0001,008,00024,576stderr