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 22:56Josu San MartinJosu San MartinScore: 3,251Success
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 22:573,20336,271,21025,233,0001,033,0002,121,728stderr
2Sep 3, 2026 22:573,22436,500,10325,412,0001,031,0002,121,728stderr
3Sep 3, 2026 22:573,23136,538,76525,472,0001,028,0002,121,728stderr
4Sep 3, 2026 22:573,23236,461,71925,471,0001,038,0002,125,824stderr
5Sep 3, 2026 22:573,25136,626,12325,635,0001,028,0002,121,728stderr
6Sep 3, 2026 22:5715,380136,175,401125,109,0001,013,0002,121,728stderr
7Sep 3, 2026 22:5715,383136,174,928125,135,0001,007,0002,121,728stderr
8Sep 3, 2026 22:5715,387136,169,342125,172,0001,009,0002,121,728stderr
9Sep 3, 2026 22:5715,436136,452,929125,576,0001,005,0002,121,728stderr