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 listMay 10, 2026 13:17Pavel SkripkinPavel SkripkinScore: 4,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:184,09241,356,85030,455,0003,102,0002,117,632
2May 10, 2026 13:184,12344,601,80930,536,0003,276,0002,117,632
3May 10, 2026 13:184,13842,128,11230,774,0003,164,0002,117,632
4May 10, 2026 13:184,16043,890,53430,861,0003,257,0002,117,632
5May 10, 2026 13:184,16541,535,32230,866,0003,295,0002,117,632
6May 10, 2026 13:184,37345,585,17931,430,0004,436,0002,117,632
7May 10, 2026 13:1824,733211,074,044199,682,0003,132,0002,117,632
8May 10, 2026 13:1824,914211,462,023201,053,0003,249,0002,117,632
9May 10, 2026 13:1825,453216,322,842205,460,0003,259,0002,117,632