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 14:10TudyMTudyMScore: 17,048Success
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 14:1017,021155,944,080138,567,0001,007,0002,371,584
2May 3, 2026 14:1017,033156,007,958138,420,0001,253,0002,383,872
3May 3, 2026 14:1017,036158,342,869138,424,0001,273,0002,379,776
4May 3, 2026 14:1017,045155,047,490138,528,0001,244,0002,347,008
5May 3, 2026 14:1017,048155,942,607138,789,0001,008,0002,359,296
6May 3, 2026 14:1017,087157,616,529138,855,0001,261,0002,367,488
7May 3, 2026 14:1017,128156,584,049139,181,0001,276,0002,347,008
8May 3, 2026 14:1017,131156,584,980139,211,0001,269,0002,367,488
9May 3, 2026 14:1017,258158,580,609140,240,0001,276,0002,375,680