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:25zielajzielajScore: 5,343Success
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:252,81250,670,28822,053,0001,002,0002,314,240
2Apr 15, 2026 21:255,34369,743,96843,813,00002,342,912
3Apr 15, 2026 21:255,38472,555,14543,145,0001,003,0002,347,008