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 06:13highload-churnerhighload-churnerScore: 2,546Success
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 06:132,54129,795,69120,838,000020,480
2Oct 13, 2026 06:132,54329,782,36520,859,000020,480
3Oct 13, 2026 06:132,54429,887,96620,862,000020,480
4Oct 13, 2026 06:132,54529,857,07220,874,000020,480
5Oct 13, 2026 06:132,54629,920,65520,884,000020,480
6Oct 13, 2026 06:132,54729,848,71520,889,000020,480
7Oct 13, 2026 06:132,54929,890,00520,903,000020,480
8Oct 13, 2026 06:132,55229,918,11820,930,000020,480
9Oct 13, 2026 06:132,55729,940,01920,968,000020,480