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:50TudyMTudyMScore: 17,202Success
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:5517,180156,491,985139,653,0001,230,0002,355,200
2May 3, 2026 13:5517,181160,351,834139,882,0001,006,0002,347,008
3May 3, 2026 13:5517,194158,341,795139,984,0001,009,0002,351,104
4May 3, 2026 13:5517,196155,107,939139,773,0001,242,0002,359,296
5May 3, 2026 13:5517,202155,677,339139,828,0001,232,0002,351,104
6May 3, 2026 13:5517,220157,948,499140,204,0001,007,0002,347,008
7May 3, 2026 13:5517,220157,217,568139,932,0001,274,0002,342,912
8May 3, 2026 13:5517,232157,652,444140,296,0001,009,0002,342,912
9May 3, 2026 13:5517,452159,567,118142,106,0001,006,0002,355,200