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 08:56Victor MerckléVictor MerckléScore: 2,729Success
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 08:572,71830,598,98822,291,000024,576stderr
2Sep 8, 2026 08:572,71830,666,34522,293,000024,576stderr
3Sep 8, 2026 08:572,71830,662,64722,291,000024,576stderr
4Sep 8, 2026 08:572,72030,700,48322,308,000024,576stderr
5Sep 8, 2026 08:572,72930,799,29422,380,000024,576stderr
6Sep 8, 2026 08:572,72930,778,70322,383,000024,576stderr
7Sep 8, 2026 08:575,51353,624,32944,193,0001,015,00024,576stderr
8Sep 8, 2026 08:575,53953,739,32744,406,0001,014,00024,576stderr
9Sep 8, 2026 08:575,55653,969,28144,551,0001,016,00024,576stderr