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:03Victor MerckléVictor MerckléScore: 2,599Success
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:042,58729,442,02821,218,000024,576stderr
2Sep 8, 2026 10:042,59029,601,83921,238,000028,672stderr
3Sep 8, 2026 10:042,59329,686,19421,263,000024,576stderr
4Sep 8, 2026 10:042,59329,646,88021,265,000024,576stderr
5Sep 8, 2026 10:042,59929,664,90321,313,000024,576stderr
6Sep 8, 2026 10:042,60029,580,89321,323,000024,576stderr
7Sep 8, 2026 10:042,64729,995,06920,673,0001,039,00024,576stderr
8Sep 8, 2026 10:042,67730,250,36320,913,0001,041,00024,576stderr
9Sep 8, 2026 10:042,74230,796,61421,141,0001,345,00024,576stderr