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, 2025 23:59Christopher TarryChristopher TarryScore: 102,845Success
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, 2025 23:5983,450706,882,056485,498,000198,794,0002,404,352
2May 11, 2025 23:5998,007832,955,226616,740,000186,921,0002,347,008
3May 11, 2025 23:59100,180845,107,235626,598,000194,875,0002,297,856
4May 11, 2025 23:59102,538865,467,008651,851,000188,957,0002,420,736
5May 11, 2025 23:59102,845867,618,761658,478,000184,853,0002,400,256
6May 11, 2025 23:59103,340873,693,723649,534,000197,858,0002,277,376
7May 11, 2025 23:59106,519899,477,572681,577,000191,881,0002,265,088
8May 11, 2025 23:59113,052956,376,623730,231,000196,792,0002,306,048
9May 11, 2025 23:59114,277960,649,933738,271,000198,803,0002,306,048