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 listJul 2, 2026 14:23A_ShamanA_ShamanScore: 14,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:2414,127125,269,531113,794,0002,051,0002,113,536
2Jul 2, 2026 14:2414,288126,622,685115,111,0002,056,0002,113,536
3Jul 2, 2026 14:2414,430127,774,384116,217,0002,112,0002,113,536
4Jul 2, 2026 14:2414,552128,661,542117,270,0002,062,0002,113,536
5Jul 2, 2026 14:2414,603129,126,393117,705,0002,045,0002,113,536
6Jul 2, 2026 14:2414,688129,911,490118,337,0002,107,0002,113,536
7Jul 2, 2026 14:2414,965132,047,238120,622,0002,099,0002,113,536
8Jul 2, 2026 14:2415,049133,226,693121,224,0002,184,0002,113,536
9Jul 2, 2026 14:2415,113133,323,671121,764,0002,166,0002,113,536