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 2, 2026 00:58Victor MerckléVictor MerckléScore: 3,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 00:593,46036,647,23527,301,0001,073,0002,150,400stderr
2Jul 2, 2026 00:593,50036,581,76727,651,0001,052,0002,150,400stderr
3Jul 2, 2026 00:593,52736,854,57227,881,0001,042,0002,150,400stderr
4Jul 2, 2026 00:593,56037,430,10528,111,0001,084,0002,150,400stderr
5Jul 2, 2026 00:593,59437,440,66328,368,0001,108,0002,150,400stderr
6Jul 2, 2026 00:593,75438,704,26429,704,0001,086,0002,142,208stderr
7Jul 2, 2026 00:5912,917113,855,904104,922,0001,000,0002,117,632stderr
8Jul 2, 2026 00:5912,937114,029,568105,084,0001,006,0002,117,632stderr
9Jul 2, 2026 00:5913,010116,373,357105,689,0001,000,0002,117,632stderr