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 29, 2026 22:11Dominique GarmierDominique GarmierScore: 197,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 22:11197,6001,641,520,0681,618,324,0001,999,0002,465,792
2Mar 29, 2026 22:11197,6221,651,571,4701,619,500,000999,0002,289,664
3Mar 29, 2026 22:11315,5212,613,093,5692,585,278,0001,998,0002,478,080