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 28, 2026 06:46Victor MerckléVictor MerckléScore: 12,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 06:473,14533,755,92324,625,0001,168,0002,113,536
2Jun 28, 2026 06:473,15533,705,88124,693,0001,181,0002,113,536
3Jun 28, 2026 06:473,20734,423,50825,132,0001,171,0002,113,536
4Jun 28, 2026 06:4712,153107,595,37998,653,0001,007,0002,113,536
5Jun 28, 2026 06:4712,155107,870,19698,665,0001,013,0002,113,536
6Jun 28, 2026 06:4712,167107,719,85198,765,0001,010,0002,113,536
7Jun 28, 2026 06:4712,246108,245,60599,410,0001,008,0002,113,536
8Jun 28, 2026 06:4712,687111,900,770103,033,0001,008,0002,113,536
9Jun 28, 2026 06:4712,689112,156,983103,050,0001,007,0002,113,536