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 listJan 2, 2026 05:33Rajarshi BasuRajarshi BasuScore: 101,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 05:3310,642113,415,07274,228,00013,040,0002,523,136
2Jan 2, 2026 05:33101,899861,685,549713,636,000121,937,0002,424,832
3Jan 2, 2026 05:33124,5061,053,436,813899,074,000121,874,0002,281,472