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 29, 2026 13:31Victor MerckléVictor MerckléScore: 2,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:342,79231,040,12021,774,0001,123,0002,117,632stderr
2Aug 29, 2026 13:342,79231,023,92321,771,0001,130,0002,117,632stderr
3Aug 29, 2026 13:342,79731,324,74121,750,0001,193,0002,117,632stderr
4Aug 29, 2026 13:342,79831,046,36621,815,0001,135,0002,117,632stderr
5Aug 29, 2026 13:342,79931,290,39021,754,0001,202,0002,117,632stderr
6Aug 29, 2026 13:342,80831,752,77321,830,0001,196,0002,117,632stderr
7Aug 29, 2026 13:342,81731,202,07621,901,0001,203,0002,117,632stderr
8Aug 29, 2026 13:345,45252,890,46343,690,0001,017,0002,117,632stderr
9Aug 29, 2026 13:3414,750129,140,358119,944,0001,008,0002,117,632stderr