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 listMay 1, 2026 18:11Pavel SkripkinPavel SkripkinScore: 12,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 18:1112,803121,422,763103,992,000999,0002,428,928
2May 1, 2026 18:1112,807121,215,777102,022,0003,000,0002,318,336
3May 1, 2026 18:1112,852127,541,908103,387,0002,007,0002,420,736
4May 1, 2026 18:1112,855121,776,050103,407,0002,007,0002,420,736
5May 1, 2026 18:1112,858127,582,912102,427,0003,012,0002,318,336
6May 1, 2026 18:1112,862121,471,004104,455,0001,014,0002,416,640
7May 1, 2026 18:1112,865125,310,648103,490,0002,009,0002,428,928
8May 1, 2026 18:1112,888121,261,267102,695,0002,991,0002,424,832
9May 1, 2026 18:1112,898126,567,633102,776,0002,993,0002,416,640