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 16, 2026 23:10Tomislav TunkovicTomislav TunkovicScore: 2,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 03:572,72532,446,63621,136,0001,214,0002,117,632
2Aug 17, 2026 03:572,73132,415,82621,182,0001,218,0002,117,632
3Aug 17, 2026 03:572,73733,088,57721,214,0001,234,0002,117,632
4Aug 17, 2026 03:572,74232,459,29221,223,0001,262,0002,117,632
5Aug 17, 2026 03:572,74333,240,92221,258,0001,236,0002,117,632
6Aug 17, 2026 03:572,74632,455,80921,282,0001,238,0002,117,632
7Aug 17, 2026 03:572,75232,472,13821,344,0001,225,0002,117,632
8Aug 17, 2026 03:575,41554,349,79443,378,0001,031,0002,117,632
9Aug 17, 2026 03:575,46455,414,67843,774,0001,034,0002,117,632