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 listJun 8, 2026 16:20Victor MerckléVictor MerckléScore: 6,529Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 16:213,36336,771,06026,558,0001,026,0002,113,536
2Jun 8, 2026 16:213,38636,905,68726,725,0001,041,0002,113,536
3Jun 8, 2026 16:213,42239,555,12727,007,0001,061,0002,113,536
4Jun 8, 2026 16:213,45237,611,38827,256,0001,055,0002,113,536
5Jun 8, 2026 16:216,52962,699,88151,348,0002,195,0002,113,536
6Jun 8, 2026 16:216,55062,817,06151,475,0002,242,0002,113,536
7Jun 8, 2026 16:216,60263,272,65452,110,0002,032,0002,113,536
8Jun 8, 2026 16:216,65363,707,39152,526,0002,035,0002,113,536
9Jun 8, 2026 16:2113,604120,707,929109,544,0002,015,0002,113,536