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 02:47highload-churnerhighload-churnerScore: 2,496Success
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 02:482,48729,412,25820,399,000020,480
2Oct 15, 2026 02:482,49229,465,26620,438,000020,480
3Oct 15, 2026 02:482,49229,482,20120,435,000020,480
4Oct 15, 2026 02:482,49529,464,32420,467,000020,480
5Oct 15, 2026 02:482,49629,570,91520,471,000020,480
6Oct 15, 2026 02:482,49629,529,81020,473,000020,480
7Oct 15, 2026 02:483,54538,077,95325,583,0003,491,00020,480
8Oct 15, 2026 02:483,59238,430,66226,130,0003,332,00020,480
9Oct 15, 2026 02:484,15343,130,84730,832,0003,223,00020,480