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 08:54marko1597marko1597Score: 2,847Success
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 09:192,82831,573,08222,016,0001,177,0002,117,632stderr
2Aug 16, 2026 09:192,83031,369,29222,011,0001,196,0002,117,632stderr
3Aug 16, 2026 09:192,83031,687,53722,036,0001,174,0002,117,632stderr
4Aug 16, 2026 09:192,83331,659,32622,063,0001,172,0002,117,632stderr
5Aug 16, 2026 09:192,84731,798,68522,149,0001,204,0002,117,632stderr
6Aug 16, 2026 09:196,92065,171,37655,563,0001,189,0002,117,632stderr
7Aug 16, 2026 09:196,96765,258,88155,996,0001,134,0002,117,632stderr
8Aug 16, 2026 09:196,97065,670,51856,022,0001,134,0002,117,632stderr
9Aug 16, 2026 09:197,04066,738,07756,559,0001,173,0002,117,632stderr