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 listMar 20, 2026 05:51olliecrowolliecrowScore: 170,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 05:5175,697651,811,060618,718,0001,999,0002,342,912
2Mar 20, 2026 05:51170,4831,424,151,3911,394,962,0002,997,0002,404,352
3Mar 20, 2026 05:51172,1901,435,380,6991,408,961,0002,997,0002,334,720