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 listApr 25, 2026 05:31limanjun99limanjun99Score: 45,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 05:3244,585383,757,822361,607,0003,995,0002,420,736
2Apr 25, 2026 05:3244,607385,636,508359,785,0005,996,0002,433,024
3Apr 25, 2026 05:3245,226389,320,095361,863,0008,996,0002,416,640
4Apr 25, 2026 05:3245,353392,059,607364,903,0006,998,0002,473,984
5Apr 25, 2026 05:3245,458392,600,589366,767,0005,996,0002,359,296
6Apr 25, 2026 05:3245,771393,922,247370,324,0005,004,0002,555,904
7Apr 25, 2026 05:3247,049407,439,222379,812,0005,997,0002,330,624
8Apr 25, 2026 05:3247,119403,117,642382,374,0004,003,0002,416,640
9Apr 25, 2026 05:3248,254412,396,732389,692,0005,995,0002,301,952