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 23:31Dominique GarmierDominique GarmierScore: 68,758Success
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 23:3154,067471,316,601299,563,000143,790,0002,347,008
2Mar 21, 2026 23:3168,758589,920,495414,864,000148,951,0002,465,792
3Mar 21, 2026 23:3175,901647,640,272480,529,000141,861,0002,322,432