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:11Tomislav TunkovicTomislav TunkovicScore: 53,253Success
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 04:3850,980426,602,674415,875,0002,162,0002,138,112
2Aug 17, 2026 04:3851,276428,986,140418,308,0002,156,0002,138,112
3Aug 17, 2026 04:3852,750441,140,186430,391,0002,162,0002,138,112
4Aug 17, 2026 04:3852,832442,344,448430,989,0002,235,0002,138,112
5Aug 17, 2026 04:3853,253445,378,061434,460,0002,218,0002,138,112
6Aug 17, 2026 04:3853,363446,257,392435,353,0002,229,0002,138,112
7Aug 17, 2026 04:3853,541447,708,429436,852,0002,185,0002,138,112
8Aug 17, 2026 04:3853,572448,480,229437,086,0002,208,0002,138,112
9Aug 17, 2026 04:38103,509857,485,900845,700,0003,079,0002,138,112