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 04:56Josu San MartinJosu San MartinScore: 11,673Success
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 04:573,62840,492,47528,721,0001,035,0002,113,536
2Sep 3, 2026 04:5710,79699,337,82082,878,0005,653,0002,113,536
3Sep 3, 2026 04:5710,910100,306,55583,768,0005,694,0002,113,536
4Sep 3, 2026 04:5711,270103,206,93986,158,0006,263,0002,113,536
5Sep 3, 2026 04:5711,673106,393,96189,371,0006,352,0002,113,536
6Sep 3, 2026 04:5712,064108,950,01792,098,0006,833,0002,113,536
7Sep 3, 2026 04:5718,377160,822,457144,298,0006,401,0002,117,632
8Sep 3, 2026 04:5718,653163,846,440146,765,0006,197,0002,117,632
9Sep 3, 2026 04:5721,704189,848,320171,497,0006,480,0002,117,632