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 15, 2026 01:51highload-churnerhighload-churnerScore: 2,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 01:522,49129,495,83420,430,000020,480
2Oct 15, 2026 01:522,49129,451,38420,431,000020,480
3Oct 15, 2026 01:522,49429,461,20120,457,000020,480
4Oct 15, 2026 01:522,49529,384,77220,459,000020,480
5Oct 15, 2026 01:522,49929,542,96620,493,000020,480
6Oct 15, 2026 01:522,49929,496,68420,499,000020,480
7Oct 15, 2026 01:522,50329,601,71620,531,000020,480
8Oct 15, 2026 01:522,51429,634,59820,616,000020,480
9Oct 15, 2026 01:524,69347,556,25235,472,0003,011,00020,480