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 15, 2026 21:20zielajzielajScore: 5,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 21:202,81446,933,44622,073,0001,003,0002,514,944
2Apr 15, 2026 21:205,35867,533,44342,936,000998,0002,416,640
3Apr 15, 2026 21:205,39465,378,79942,221,0002,010,0002,502,656