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 13, 2026 14:49highload-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 13, 2026 14:502,49229,472,26920,441,000020,480
2Oct 13, 2026 14:502,49429,455,69820,453,000020,480
3Oct 13, 2026 14:502,49829,500,97920,491,000020,480
4Oct 13, 2026 14:502,49929,588,16520,495,000020,480
5Oct 13, 2026 14:502,49929,696,54920,492,000020,480
6Oct 13, 2026 14:502,49929,554,80920,497,000020,480
7Oct 13, 2026 14:503,59138,436,59826,189,0003,264,00020,480
8Oct 13, 2026 14:504,02041,980,21130,906,0002,059,00020,480
9Oct 13, 2026 14:504,15342,960,02130,740,0003,320,00020,480