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 10, 2026 13:19Pavel SkripkinPavel SkripkinScore: 4,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:204,06140,478,67730,166,0003,142,0002,117,632
2May 10, 2026 13:204,11441,072,26530,582,0003,157,0002,117,632
3May 10, 2026 13:204,16943,857,26730,937,0003,252,0002,117,632
4May 10, 2026 13:204,20541,726,70431,168,0003,319,0002,117,632
5May 10, 2026 13:204,27842,580,09530,946,0004,136,0002,117,632
6May 10, 2026 13:2024,725212,263,811199,645,0003,100,0002,117,632
7May 10, 2026 13:2024,870212,545,029199,827,0004,112,0002,117,632
8May 10, 2026 13:2025,167217,212,342203,124,0003,246,0002,117,632
9May 10, 2026 13:2025,294215,594,738204,271,0003,140,0002,117,632