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 14, 2026 23:48zielajzielajScore: 5,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 23:482,85246,733,83123,386,00002,318,336
2Apr 14, 2026 23:485,41370,456,44942,372,0002,017,0002,359,296
3Apr 14, 2026 23:485,48368,763,99142,963,0001,998,0002,490,368