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 5, 2026 04:04Victor MerckléVictor MerckléScore: 3,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 04:043,39636,986,57026,812,0001,041,0002,113,536
2Jun 5, 2026 04:043,40836,998,32926,898,0001,053,0002,113,536
3Jun 5, 2026 04:043,41737,091,60126,973,0001,047,0002,113,536
4Jun 5, 2026 04:043,43337,233,22427,100,0001,053,0002,113,536
5Jun 5, 2026 04:043,43737,259,24627,153,0001,036,0002,113,536
6Jun 5, 2026 04:043,46437,522,54826,366,0002,039,0002,113,536
7Jun 5, 2026 04:043,47437,611,48027,456,0001,038,0002,113,536
8Jun 5, 2026 04:043,49837,784,63226,598,0002,091,0002,113,536
9Jun 5, 2026 04:0412,882114,723,647103,363,0002,275,0002,113,536