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 25, 2026 19:59Dominique GarmierDominique GarmierScore: 10,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 19:5910,450111,564,27582,702,0002,989,0002,363,392
2Mar 25, 2026 19:5910,455107,789,48283,738,0001,993,0002,334,720
3Mar 25, 2026 19:5910,545115,926,55684,456,0002,010,0002,486,272