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:01Victor MerckléVictor MerckléScore: 3,271Success
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:023,04233,297,44420,612,0004,334,00024,576stderr
2Sep 8, 2026 08:023,20134,628,57720,762,0005,487,00024,576stderr
3Sep 8, 2026 08:023,21734,694,97120,615,0005,771,00024,576stderr
4Sep 8, 2026 08:023,26135,136,80020,701,0006,047,00024,576stderr
5Sep 8, 2026 08:023,27135,837,66420,707,0006,118,00024,576stderr
6Sep 8, 2026 08:023,32436,260,70521,241,0006,021,00024,576stderr
7Sep 8, 2026 08:026,22059,212,13443,171,0007,837,00024,576stderr
8Sep 8, 2026 08:026,43061,053,75442,905,0009,824,00024,576stderr
9Sep 8, 2026 08:0212,322109,246,70693,596,0007,446,00024,576stderr