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 19:02Victor MerckléVictor MerckléScore: 2,649Success
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 19:032,55729,399,18320,968,000024,576stderr
2Sep 8, 2026 19:032,56229,466,51621,015,000024,576stderr
3Sep 8, 2026 19:032,59929,775,99721,312,000024,576stderr
4Sep 8, 2026 19:032,64730,190,25821,713,000024,576stderr
5Sep 8, 2026 19:032,64930,868,71121,728,000024,576stderr
6Sep 8, 2026 19:032,65530,943,13621,772,000024,576stderr
7Sep 8, 2026 19:032,65730,938,65521,789,000024,576stderr
8Sep 8, 2026 19:032,69631,242,73722,108,000024,576stderr
9Sep 8, 2026 19:0311,712104,518,59395,034,0001,009,00024,576stderr