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 18:51Victor MerckléVictor MerckléScore: 2,718Success
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 18:522,56129,450,49721,003,000024,576stderr
2Sep 8, 2026 18:522,56229,503,89321,010,000024,576stderr
3Sep 8, 2026 18:522,56329,471,18721,018,000024,576stderr
4Sep 8, 2026 18:522,71331,989,93822,247,000024,576stderr
5Sep 8, 2026 18:522,71831,283,60122,293,000024,576stderr
6Sep 8, 2026 18:522,73531,244,33522,435,000024,576stderr
7Sep 8, 2026 18:522,74631,636,20722,521,000024,576stderr
8Sep 8, 2026 18:525,37852,523,46943,091,0001,016,00024,576stderr
9Sep 8, 2026 18:525,62054,499,01945,073,0001,012,00024,576stderr