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 16, 2026 07:21M-RochatM-RochatScore: 28,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 07:2328,301241,502,089230,828,0001,245,0002,113,536
2May 16, 2026 07:2328,401241,948,525231,669,0001,223,0002,113,536
3May 16, 2026 07:2328,502244,149,604232,720,0001,002,0002,113,536
4May 16, 2026 07:2328,620243,487,638233,444,0001,246,0002,113,536
5May 16, 2026 07:2328,657243,766,064233,768,0001,224,0002,113,536
6May 16, 2026 07:2328,777244,752,021234,719,0001,253,0002,113,536
7May 16, 2026 07:2328,809245,064,103235,008,0001,233,0002,113,536
8May 16, 2026 07:2328,873245,523,049235,545,0001,216,0002,113,536
9May 16, 2026 07:2329,873253,977,895243,689,0001,271,0002,113,536