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 listNov 4, 2026 20:30e1011e1011Score: 46,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 20:3146,308390,635,710237,962,000141,770,0002,113,536
2Nov 4, 2026 20:3146,309391,129,812238,673,000141,063,0002,113,536
3Nov 4, 2026 20:3146,331391,237,040238,736,000141,184,0002,113,536
4Nov 4, 2026 20:3146,352391,002,134238,147,000141,943,0002,113,536
5Nov 4, 2026 20:3146,362395,566,402238,539,000141,633,0002,113,536
6Nov 4, 2026 20:3146,810395,348,724242,612,000141,231,0002,113,536
7Nov 4, 2026 20:3146,927395,785,618242,808,000141,998,0002,113,536
8Nov 4, 2026 20:3146,968397,481,987243,840,000141,298,0002,113,536
9Nov 4, 2026 20:3147,347399,173,040247,286,000140,965,0002,113,536