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 listOct 6, 2026 08:01janwwwjanwwwScore: 969,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 08:03962,4857,903,497,7427,737,930,000154,452,0002,113,536
2Oct 6, 2026 08:03969,2017,958,823,0017,794,615,000152,836,0002,113,536
3Oct 6, 2026 08:03969,2497,959,039,7897,791,909,000155,936,0002,113,536