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 29, 2026 09:55Victor MerckléVictor MerckléScore: 5,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 09:582,75430,929,14021,472,0001,111,0002,117,632stderr
2Aug 29, 2026 09:582,76031,004,49821,580,0001,055,0002,117,632stderr
3Aug 29, 2026 09:582,76231,671,89521,609,0001,047,0002,117,632stderr
4Aug 29, 2026 09:582,77931,165,77921,683,0001,109,0002,117,632stderr
5Aug 29, 2026 09:585,35652,333,25242,883,0001,044,0002,117,632stderr
6Aug 29, 2026 09:585,41052,713,04443,239,0001,130,0002,117,632stderr
7Aug 29, 2026 09:585,43252,896,02643,518,0001,031,0002,117,632stderr
8Aug 29, 2026 09:585,44352,937,03243,450,0001,187,0002,117,632stderr
9Aug 29, 2026 09:585,55053,859,93144,497,0001,019,0002,117,632stderr