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 11, 2026 18:05Pavel SkripkinPavel SkripkinScore: 4,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:064,44545,922,60232,420,0004,032,0002,117,632
2May 11, 2026 18:064,48245,695,54733,586,0003,172,0002,117,632
3May 11, 2026 18:064,48646,257,73633,547,0003,246,0002,117,632
4May 11, 2026 18:064,50545,891,76333,723,0003,221,0002,117,632
5May 11, 2026 18:064,54546,177,32133,207,0004,063,0002,117,632
6May 11, 2026 18:064,56246,283,17233,380,0004,034,0002,117,632
7May 11, 2026 18:064,76648,354,90634,184,0004,901,0002,117,632
8May 11, 2026 18:0624,901213,037,944201,021,0003,172,0002,117,632
9May 11, 2026 18:0625,831220,628,446207,606,0004,210,0002,117,632