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 14, 2026 20:33marko1597marko1597Score: 3,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:443,56337,399,02428,168,0001,052,0002,121,728stderr
2Aug 14, 2026 20:443,56437,642,66428,187,0001,040,0002,121,728stderr
3Aug 14, 2026 20:443,56737,545,06228,208,0001,045,0002,121,728stderr
4Aug 14, 2026 20:443,57738,451,12628,301,0001,034,0002,121,728stderr
5Aug 14, 2026 20:443,59737,980,31228,459,0001,042,0002,121,728stderr
6Aug 14, 2026 20:443,60237,692,44128,478,0001,061,0002,121,728stderr
7Aug 14, 2026 20:443,61738,814,43628,618,0001,046,0002,121,728stderr
8Aug 14, 2026 20:443,61939,361,12728,632,0001,050,0002,121,728stderr
9Aug 14, 2026 20:443,64638,128,64328,840,0001,064,0002,121,728stderr