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 08:12limanjun99limanjun99Error
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 08:12053,271,73230,764,0002,977,0002,334,720expected "2106709123 ", got "2105826827"
2Apr 25, 2026 08:12054,247,40431,269,0003,026,0002,510,848expected "2186696611 ", got "2184934839"
3Apr 25, 2026 08:12052,179,29930,756,0002,976,0002,514,944expected "2155422463 ", got "2156631256"