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 listAug 18, 2026 06:07Josu San MartinJosu San MartinScore: 3,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 06:083,33437,199,61926,282,0001,058,0002,117,632
2Aug 18, 2026 06:083,34037,542,42526,330,0001,063,0002,117,632
3Aug 18, 2026 06:083,36137,690,57126,487,0001,074,0002,117,632
4Aug 18, 2026 06:083,36738,265,43526,575,0001,035,0002,117,632
5Aug 18, 2026 06:083,37537,624,02126,645,0001,037,0002,117,632
6Aug 18, 2026 06:0811,420103,474,87591,635,0002,011,0002,117,632
7Aug 18, 2026 06:0811,423103,612,99591,650,0002,026,0002,117,632
8Aug 18, 2026 06:0811,453103,761,68291,890,0002,030,0002,117,632
9Aug 18, 2026 06:0811,488108,813,15892,091,0002,115,0002,117,632