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 listSep 3, 2026 17:33Josu San MartinJosu San MartinScore: 3,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:343,29536,969,74425,831,0001,195,0002,117,632
2Sep 3, 2026 17:343,30737,305,94126,105,0001,019,0002,117,632
3Sep 3, 2026 17:343,31937,105,75126,022,0001,197,0002,117,632
4Sep 3, 2026 17:343,32537,220,35125,981,0001,286,0002,117,632
5Sep 3, 2026 17:343,32937,463,39826,278,0001,024,0002,117,632
6Sep 3, 2026 17:343,34037,282,32526,370,0001,022,0002,117,632
7Sep 3, 2026 17:343,34037,288,79326,108,0001,281,0002,117,632
8Sep 3, 2026 17:343,38539,464,59426,730,0001,032,0002,117,632
9Sep 3, 2026 17:3415,419137,749,132125,434,0001,005,0002,117,632