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 1, 2026 16:41C21C21Score: 3,717Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 16:423,68640,802,94028,053,0002,175,0002,117,632stderr
2Oct 1, 2026 16:423,69141,520,24527,959,0002,310,0002,117,632stderr
3Oct 1, 2026 16:423,70342,404,43728,260,0002,112,0002,117,632stderr
4Oct 1, 2026 16:423,70741,660,99428,082,0002,318,0002,117,632stderr
5Oct 1, 2026 16:423,71741,754,49028,161,0002,319,0002,117,632stderr
6Oct 1, 2026 16:423,72441,234,82328,257,0002,286,0002,117,632stderr
7Oct 1, 2026 16:423,72741,220,79928,358,0002,204,0002,117,632stderr
8Oct 1, 2026 16:423,73041,904,56928,302,0002,291,0002,117,632stderr
9Oct 1, 2026 16:423,83146,622,04129,260,0002,158,0002,117,632stderr