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 22, 2026 23:40izotoffizotoffScore: 40,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 23:4038,276343,028,112310,867,0002,998,0002,502,656
2Mar 22, 2026 23:4040,204358,697,567326,675,0002,997,0002,330,624
3Mar 22, 2026 23:4040,634361,421,982329,194,0004,002,0002,334,720