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 22, 2026 22:28M-RochatM-RochatScore: 16,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 22:2816,588145,433,552133,010,0003,012,0002,113,536
2May 22, 2026 22:2816,610148,579,526134,179,0002,029,0002,117,632
3May 22, 2026 22:2816,658146,386,307134,588,0002,015,0002,117,632
4May 22, 2026 22:2816,671146,110,558134,693,0002,017,0002,113,536
5May 22, 2026 22:2816,676148,956,056134,731,0002,017,0002,113,536
6May 22, 2026 22:2816,677148,250,652134,739,0002,015,0002,117,632
7May 22, 2026 22:2816,708147,459,640133,975,0003,036,0002,113,536
8May 22, 2026 22:2816,731149,658,704134,163,0003,035,0002,113,536
9May 22, 2026 22:2816,753147,324,675135,365,0002,015,0002,113,536