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 listJun 17, 2026 15:39Maya RebholzMaya RebholzScore: 9,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:409,70488,770,57878,557,0001,022,0002,113,536
2Jun 17, 2026 15:409,70489,168,36978,562,0001,018,0002,113,536
3Jun 17, 2026 15:409,70588,798,56678,567,0001,015,0002,113,536
4Jun 17, 2026 15:409,70588,799,63278,568,0001,014,0002,113,536
5Jun 17, 2026 15:409,70589,262,66578,566,0001,018,0002,113,536
6Jun 17, 2026 15:409,78791,481,98579,217,0001,038,0002,113,536
7Jun 17, 2026 15:4010,42795,177,66484,472,0001,036,0002,113,536
8Jun 17, 2026 15:4010,49295,390,72385,018,0001,024,0002,113,536
9Jun 17, 2026 15:4010,49895,227,28385,072,0001,013,0002,113,536