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 07:28marko1597marko1597Score: 2,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 07:502,83731,735,75122,222,0001,043,0002,117,632stderr
2Aug 16, 2026 07:502,85031,901,22022,090,0001,283,0002,117,632stderr
3Aug 16, 2026 07:502,85331,821,21422,125,0001,273,0002,117,632stderr
4Aug 16, 2026 07:502,85731,996,30022,401,0001,030,0002,117,632stderr
5Aug 16, 2026 07:502,85931,942,61722,422,0001,029,0002,117,632stderr
6Aug 16, 2026 07:506,99065,833,60756,132,0001,190,0002,117,632stderr
7Aug 16, 2026 07:507,10866,719,84457,079,0001,207,0002,117,632stderr
8Aug 16, 2026 07:507,12166,775,98957,207,0001,188,0002,117,632stderr
9Aug 16, 2026 07:507,15267,032,31557,462,0001,190,0002,117,632stderr