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 19, 2026 14:37Dominique GarmierDominique GarmierScore: 162,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 14:37161,8101,356,003,6181,320,855,0005,990,0002,441,216
2Mar 19, 2026 14:37162,0691,360,021,2821,323,967,0004,996,0002,297,856
3Mar 19, 2026 14:37163,6791,372,247,7281,335,175,0006,990,0002,281,472