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:25M-RochatM-RochatScore: 17,347Success
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:265,33453,916,55540,514,0003,228,0002,113,536
2May 22, 2026 22:265,35855,125,24440,658,0003,282,0002,113,536
3May 22, 2026 22:265,48255,016,58341,658,0003,296,0002,113,536
4May 22, 2026 22:265,50156,615,52841,808,0003,303,0002,113,536
5May 22, 2026 22:2617,347154,350,407137,898,0004,350,0002,117,632
6May 22, 2026 22:2617,351152,047,852137,925,0004,354,0002,117,632
7May 22, 2026 22:2617,379152,748,926138,326,0004,183,0002,113,536
8May 22, 2026 22:2617,442153,541,956138,503,0004,525,0002,117,632
9May 22, 2026 22:2617,507153,509,599139,337,0004,227,0002,113,536