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 02:12zielajzielajScore: 5,370Success
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 02:122,82752,086,76520,159,0003,023,0002,375,680
2Apr 15, 2026 02:125,37069,954,30942,036,0002,001,0002,445,312
3Apr 15, 2026 02:125,64866,950,29245,310,0001,006,0002,297,856