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 19, 2026 13:16Victor MerckléVictor MerckléScore: 5,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 13:172,80031,186,40321,823,0001,145,0002,117,632stderr
2Aug 19, 2026 13:172,85331,690,07322,391,0001,009,0002,117,632stderr
3Aug 19, 2026 13:172,86331,646,04322,332,0001,148,0002,117,632stderr
4Aug 19, 2026 13:172,87431,875,39722,451,0001,121,0002,117,632stderr
5Aug 19, 2026 13:175,44352,975,26843,502,0001,137,0002,117,632stderr
6Aug 19, 2026 13:175,47253,733,36943,748,0001,129,0002,117,632stderr
7Aug 19, 2026 13:175,47454,409,67443,821,0001,071,0002,117,632stderr
8Aug 19, 2026 13:175,47853,105,50543,891,0001,034,0002,117,632stderr
9Aug 19, 2026 13:176,03857,804,57248,495,0001,018,0002,117,632stderr