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 20, 2026 03:57olliecrowolliecrowScore: 3,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:573,53558,531,93825,988,0002,998,0002,297,856
2Mar 20, 2026 03:573,63657,077,96827,830,0001,987,0002,310,144
3Mar 20, 2026 03:5723,485218,360,882189,580,0002,993,0002,297,856