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 00:59highload-churnerhighload-churnerScore: 2,503Success
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 00:592,49129,492,76320,434,000020,480
2Oct 15, 2026 00:592,49229,413,55320,442,000020,480
3Oct 15, 2026 00:592,49529,501,80520,461,000020,480
4Oct 15, 2026 00:592,49929,501,06220,497,000020,480
5Oct 15, 2026 00:592,50329,547,49620,530,000020,480
6Oct 15, 2026 00:595,82156,762,45744,493,0003,243,00020,480
7Oct 15, 2026 00:595,83556,861,80544,533,0003,314,00020,480
8Oct 15, 2026 00:595,84856,992,72344,604,0003,352,00020,480
9Oct 15, 2026 00:595,89457,387,47244,788,0003,548,00020,480