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 10:10Victor MerckléVictor MerckléScore: 2,650Success
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 10:132,64030,023,82421,649,000024,576stderr
2Sep 8, 2026 10:132,64129,961,69121,664,000024,576stderr
3Sep 8, 2026 10:132,64429,900,96621,684,000024,576stderr
4Sep 8, 2026 10:132,64629,985,09021,702,000024,576stderr
5Sep 8, 2026 10:132,65030,895,93721,731,000024,576stderr
6Sep 8, 2026 10:132,66231,000,48521,829,000024,576stderr
7Sep 8, 2026 10:132,67230,257,35720,881,0001,035,00024,576stderr
8Sep 8, 2026 10:132,68630,421,87320,948,0001,084,00024,576stderr
9Sep 8, 2026 10:135,50953,438,06744,166,0001,014,00024,576stderr