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 11:52highload-churnerhighload-churnerScore: 2,502Success
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 11:532,49429,439,97520,457,000020,480
2Oct 13, 2026 11:532,49829,390,74520,488,000020,480
3Oct 13, 2026 11:532,49929,454,30320,492,000020,480
4Oct 13, 2026 11:532,50029,477,45520,507,000020,480
5Oct 13, 2026 11:532,50229,465,22320,520,000020,480
6Oct 13, 2026 11:532,50329,526,07120,525,000020,480
7Oct 13, 2026 11:532,50529,487,21420,547,000020,480
8Oct 13, 2026 11:532,50529,493,06720,543,000020,480
9Oct 13, 2026 11:532,50629,495,24720,553,000020,480