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 06:21Josu San MartinJosu San MartinScore: 11,302Success
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 06:223,24536,561,84225,588,0001,022,0002,117,632
2Sep 3, 2026 06:223,25537,444,79725,676,0001,023,0002,117,632
3Sep 3, 2026 06:223,25836,680,94725,428,0001,293,0002,117,632
4Sep 3, 2026 06:223,25936,697,32925,705,0001,025,0002,117,632
5Sep 3, 2026 06:2211,302103,373,69891,671,0001,011,0002,117,632
6Sep 3, 2026 06:2211,334102,950,94391,929,0001,014,0002,117,632
7Sep 3, 2026 06:2211,336102,948,52691,947,0001,010,0002,117,632
8Sep 3, 2026 06:2211,397104,217,50892,448,0001,009,0002,117,632
9Sep 3, 2026 06:2211,547105,331,96793,681,0001,009,0002,117,632