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 19, 2026 01:37zielajzielajScore: 5,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 01:372,82550,470,78521,152,0002,014,0002,510,848
2Apr 19, 2026 01:375,27665,329,99241,250,0002,012,0002,351,104
3Apr 19, 2026 01:375,29065,648,81043,380,00002,420,736