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 03:12highload-churnerhighload-churnerScore: 2,493Success
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 03:132,48829,410,61820,407,000020,480
2Oct 15, 2026 03:132,49229,498,45420,439,000020,480
3Oct 15, 2026 03:132,49329,626,64320,445,000020,480
4Oct 15, 2026 03:132,49329,467,85320,447,000020,480
5Oct 15, 2026 03:132,49329,479,38020,450,000020,480
6Oct 15, 2026 03:132,50629,489,70220,554,000020,480
7Oct 15, 2026 03:134,11442,726,67130,509,0003,228,00020,480
8Oct 15, 2026 03:135,82656,921,26144,556,0003,221,00020,480
9Oct 15, 2026 03:135,87657,252,65044,742,0003,448,00020,480