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 20:08Josu San MartinJosu San MartinScore: 3,242Success
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 20:093,21336,288,59125,320,0001,027,0002,117,632
2Sep 3, 2026 20:093,22236,390,31025,221,0001,201,0002,117,632
3Sep 3, 2026 20:093,24036,591,41725,537,0001,031,0002,117,632
4Sep 3, 2026 20:093,24136,598,91325,365,0001,213,0002,117,632
5Sep 3, 2026 20:093,24236,608,51325,550,0001,036,0002,117,632
6Sep 3, 2026 20:093,25138,724,24825,634,0001,030,0002,117,632
7Sep 3, 2026 20:0915,394136,142,787125,220,0001,017,0002,117,632
8Sep 3, 2026 20:0915,397136,229,057125,253,0001,005,0002,117,632
9Sep 3, 2026 20:0915,420139,255,927125,412,0001,040,0002,117,632