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 21, 2026 13:14Dominique GarmierDominique GarmierScore: 16,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 13:1416,143156,603,263129,365,0003,008,0002,424,832
2Mar 21, 2026 13:1416,325162,189,400129,866,0003,995,0002,293,760
3Mar 21, 2026 13:1416,605173,511,553132,184,0003,975,0002,314,240