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 15:20NicoNicoScore: 5,992Success
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 15:215,82458,172,59343,485,0004,274,0002,113,536
2Oct 1, 2026 15:215,92261,121,63744,200,0004,364,0002,117,632
3Oct 1, 2026 15:215,97059,439,25944,883,0004,073,0002,113,536
4Oct 1, 2026 15:215,97459,367,90044,798,0004,195,0002,113,536
5Oct 1, 2026 15:215,99259,573,35344,917,0004,222,0002,113,536
6Oct 1, 2026 15:216,00659,683,49345,137,0004,118,0002,113,536
7Oct 1, 2026 15:216,02059,783,79645,103,0004,268,0002,113,536
8Oct 1, 2026 15:216,05460,046,78545,002,0004,648,0002,113,536
9Oct 1, 2026 15:216,13160,689,61846,044,0004,237,0002,113,536