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 7, 2026 16:47Victor MerckléVictor MerckléScore: 2,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:492,68530,486,32322,024,000024,576stderr
2Sep 7, 2026 16:492,68530,533,21222,023,000024,576stderr
3Sep 7, 2026 16:492,70930,658,54222,219,000024,576stderr
4Sep 7, 2026 16:492,71231,402,11022,245,000024,576stderr
5Sep 7, 2026 16:492,71431,373,93822,256,000024,576stderr
6Sep 7, 2026 16:492,71931,067,68722,296,000024,576stderr
7Sep 7, 2026 16:492,73630,914,21621,418,0001,022,00024,576stderr
8Sep 7, 2026 16:495,45953,144,93843,696,0001,074,00024,576stderr
9Sep 7, 2026 16:495,50353,395,30744,118,0001,010,00024,576stderr