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 26, 2026 07:14Zhou180Zhou180Score: 3,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:143,68440,776,12328,184,0002,027,0002,117,632
2Jun 26, 2026 07:143,69139,495,96128,231,0002,043,0002,117,632
3Jun 26, 2026 07:143,70539,494,84128,293,0002,089,0002,117,632
4Jun 26, 2026 07:143,73039,807,71528,461,0002,128,0002,117,632
5Jun 26, 2026 07:143,73139,726,13928,502,0002,096,0002,117,632
6Jun 26, 2026 07:143,73739,843,99628,596,0002,050,0002,117,632
7Jun 26, 2026 07:1421,316183,964,883172,783,0002,013,0002,117,632
8Jun 26, 2026 07:1421,969189,755,115177,139,0003,012,0002,117,632
9Jun 26, 2026 07:1421,969189,299,740178,136,0002,014,0002,117,632