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 09:02Pavel SkripkinPavel SkripkinScore: 4,354Success
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 09:034,25349,516,02531,749,0003,127,0002,502,656
2May 10, 2026 09:034,25453,262,72031,495,0003,388,0002,531,328
3May 10, 2026 09:034,28951,292,55832,048,0003,127,0002,318,336
4May 10, 2026 09:034,31950,632,63531,044,0004,379,0002,408,448
5May 10, 2026 09:034,35450,870,29731,296,0004,407,0002,392,064
6May 10, 2026 09:034,37250,714,98131,528,0004,324,0002,465,792
7May 10, 2026 09:0324,943219,697,879201,512,0003,022,0002,473,984
8May 10, 2026 09:0324,951221,193,342200,526,0004,074,0002,445,312
9May 10, 2026 09:0325,422224,070,104205,274,0003,189,0002,297,856