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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 22:063,03932,682,91123,858,0001,067,0002,113,536
2Jun 23, 2026 22:063,05032,582,32223,978,0001,033,0002,113,536
3Jun 23, 2026 22:063,06532,782,36923,992,0001,148,0002,113,536
4Jun 23, 2026 22:063,11232,992,96124,468,0001,053,0002,113,536
5Jun 23, 2026 22:063,13233,295,55124,633,0001,056,0002,113,536
6Jun 23, 2026 22:063,14133,409,65424,731,0001,028,0002,113,536
7Jun 23, 2026 22:0611,921105,359,70796,747,0001,007,0002,113,536
8Jun 23, 2026 22:0611,984105,974,79097,267,0001,007,0002,113,536
9Jun 23, 2026 22:0611,986105,945,13997,284,0001,008,0002,113,536