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 1, 2026 14:04NicoNicoScore: 998,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 14:04997,6888,192,206,9228,033,847,000147,199,0002,113,536
2Oct 1, 2026 14:04998,8198,201,132,0708,042,060,000148,256,0002,113,536
3Oct 1, 2026 14:041,003,0858,236,103,5508,072,728,000152,573,0002,113,536