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 listApr 25, 2026 07:03limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 07:03049,113,43831,601,0002,038,0002,527,232expected "2083565072 ", got "1765307475"
2Apr 25, 2026 07:034,17752,756,49631,234,0003,022,0002,547,712
3Apr 25, 2026 07:034,22053,858,97032,576,0002,036,0002,535,424