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 19, 2026 09:07Victor MerckléVictor MerckléScore: 21,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 09:1221,849187,581,099177,992,0001,176,0002,117,632stderr
2Aug 19, 2026 09:1221,860187,506,175178,089,0001,170,0002,117,632stderr
3Aug 19, 2026 09:1221,867188,265,962178,163,0001,154,0002,117,632stderr
4Aug 19, 2026 09:1221,880187,781,055178,252,0001,166,0002,117,632stderr
5Aug 19, 2026 09:1221,900187,953,429178,496,0001,087,0002,117,632stderr
6Aug 19, 2026 09:1221,900187,937,211178,479,0001,108,0002,117,632stderr
7Aug 19, 2026 09:1222,003188,899,576179,243,0001,185,0002,117,632stderr
8Aug 19, 2026 09:1224,445208,814,294199,265,0001,185,0002,117,632stderr
9Aug 19, 2026 09:1224,587211,357,918200,419,0001,201,0002,117,632stderr