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 listSep 19, 2026 18:37Andrew EpsteinAndrew EpsteinScore: 17,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:372,69131,392,58122,067,000020,480
2Sep 19, 2026 18:3717,655153,647,612144,779,000020,480
3Sep 19, 2026 18:3717,695154,017,309145,107,000020,480
4Sep 19, 2026 18:3717,709153,998,307145,214,000020,480
5Sep 19, 2026 18:3717,733154,218,442145,417,000020,480
6Sep 19, 2026 18:3717,834155,142,845146,243,000020,480
7Sep 19, 2026 18:3718,072157,058,064147,161,0001,031,00020,480
8Sep 19, 2026 18:3718,269158,711,091149,807,000020,480
9Sep 19, 2026 18:3718,979165,835,610155,631,000020,480