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 listOct 9, 2026 03:47highload-churnerhighload-churnerScore: 5,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 03:495,21353,207,51740,594,0002,157,0002,117,632
2Oct 9, 2026 03:495,35254,378,63641,851,0002,036,0002,117,632
3Oct 9, 2026 03:495,43655,425,53442,414,0002,167,0002,117,632
4Oct 9, 2026 03:495,47755,433,63742,876,0002,040,0002,117,632
5Oct 9, 2026 03:495,51255,810,11143,161,0002,040,0002,117,632
6Oct 9, 2026 03:495,51957,242,56843,220,0002,038,0002,117,632
7Oct 9, 2026 03:495,57356,229,49943,548,0002,153,0002,113,536
8Oct 9, 2026 03:495,62256,616,87944,066,0002,035,0002,117,632
9Oct 9, 2026 03:495,69157,174,63044,510,0002,159,0002,117,632