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:31highload-churnerhighload-churnerScore: 22,343Success
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:3222,099192,456,576180,207,0001,006,0002,117,632
2Oct 9, 2026 03:3222,110192,471,238180,300,0001,004,0002,117,632
3Oct 9, 2026 03:3222,137192,047,211180,527,0001,004,0002,117,632
4Oct 9, 2026 03:3222,242193,638,388181,382,0001,006,0002,117,632
5Oct 9, 2026 03:3222,343195,775,981182,211,0001,005,0002,117,632
6Oct 9, 2026 03:3222,490194,942,962182,413,0002,012,0002,113,536
7Oct 9, 2026 03:3222,553195,686,956183,930,0001,005,0002,117,632
8Oct 9, 2026 03:3222,683197,240,077185,001,0001,005,0002,113,536
9Oct 9, 2026 03:3222,848198,267,155186,351,0001,006,0002,113,536