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:44TudyMTudyMScore: 17,003Success
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:4516,954154,568,757137,882,0001,145,0002,367,488
2May 3, 2026 13:4516,983155,598,392138,118,0001,145,0002,359,296
3May 3, 2026 13:4516,993153,560,833138,097,0001,249,0002,363,392
4May 3, 2026 13:4516,995155,157,073138,217,0001,146,0002,355,200
5May 3, 2026 13:4517,003155,922,173138,242,0001,186,0002,383,872
6May 3, 2026 13:4517,013155,078,715138,335,0001,178,0002,359,296
7May 3, 2026 13:4517,138157,141,672139,530,0001,006,0002,371,584
8May 3, 2026 13:4517,337157,975,804141,009,0001,156,0002,359,296
9May 3, 2026 13:4517,371156,385,968141,442,0001,006,0002,367,488