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:34highload-churnerhighload-churnerScore: 2,495Success
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:342,48829,500,27420,407,000020,480
2Oct 15, 2026 03:342,48929,448,49620,412,000020,480
3Oct 15, 2026 03:342,49129,450,25020,427,000020,480
4Oct 15, 2026 03:342,49429,512,16020,456,000020,480
5Oct 15, 2026 03:342,49529,493,93920,463,000020,480
6Oct 15, 2026 03:343,59538,541,86426,407,0003,078,00020,480
7Oct 15, 2026 03:343,61138,580,04426,201,0003,412,00020,480
8Oct 15, 2026 03:343,61638,632,54126,257,0003,402,00020,480
9Oct 15, 2026 03:345,84856,977,71844,680,0003,275,00020,480