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:15highload-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 15, 2026 02:162,49229,698,71120,439,000020,480
2Oct 15, 2026 02:162,49429,429,17420,453,000020,480
3Oct 15, 2026 02:162,49529,562,79520,466,000020,480
4Oct 15, 2026 02:162,49729,445,13720,481,000020,480
5Oct 15, 2026 02:162,49929,527,37620,494,000020,480
6Oct 15, 2026 02:162,50029,544,02920,506,000020,480
7Oct 15, 2026 02:162,50029,565,89220,501,000020,480
8Oct 15, 2026 02:163,60438,579,79226,182,0003,376,00020,480
9Oct 15, 2026 02:165,94657,771,83845,725,0003,040,00020,480