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:21Pavel SkripkinPavel SkripkinScore: 24,925Success
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:224,10043,291,28430,177,0003,444,0002,117,632
2May 10, 2026 13:224,14342,791,08330,736,0003,238,0002,117,632
3May 10, 2026 13:224,16742,520,57630,985,0003,192,0002,117,632
4May 10, 2026 13:224,27242,248,82831,005,0004,026,0002,117,632
5May 10, 2026 13:2224,925211,863,455201,359,0003,034,0002,117,632
6May 10, 2026 13:2225,225215,711,158203,713,0003,132,0002,117,632
7May 10, 2026 13:2225,242214,383,720203,788,0003,197,0002,117,632
8May 10, 2026 13:2225,534216,790,078206,199,0003,187,0002,117,632
9May 10, 2026 13:2225,702219,685,833207,743,0003,015,0002,117,632