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 listMay 3, 2026 13:47TudyMTudyMScore: 17,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 13:4816,996159,353,498138,363,0001,006,0002,367,488
2May 3, 2026 13:4817,035153,017,943138,459,0001,236,0002,367,488
3May 3, 2026 13:4817,041153,210,132138,490,0001,249,0002,367,488
4May 3, 2026 13:4817,041155,379,311138,728,0001,011,0002,342,912
5May 3, 2026 13:4817,092156,501,178139,150,0001,008,0002,359,296
6May 3, 2026 13:4817,116156,360,137139,092,0001,261,0002,351,104
7May 3, 2026 13:4817,215158,867,980139,941,0001,222,0002,383,872
8May 3, 2026 13:4817,244157,665,947140,136,0001,271,0002,363,392
9May 3, 2026 13:4817,296159,105,588140,593,0001,239,0002,375,680