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 listSep 19, 2026 19:34Andrew EpsteinAndrew EpsteinScore: 17,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:352,64130,492,91021,661,000020,480
2Sep 19, 2026 19:352,65530,619,22821,775,000020,480
3Sep 19, 2026 19:352,66330,648,76821,844,000020,480
4Sep 19, 2026 19:3517,122149,204,397140,406,000020,480
5Sep 19, 2026 19:3517,205149,950,802141,081,000020,480
6Sep 19, 2026 19:3517,705155,582,308145,186,000020,480
7Sep 19, 2026 19:3518,222158,241,459149,422,000020,480
8Sep 19, 2026 19:3518,245158,445,388149,610,000020,480
9Sep 19, 2026 19:3518,393159,771,538150,830,000020,480