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 listJun 23, 2026 23:54Victor MerckléVictor MerckléScore: 9,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 23:559,83988,243,49179,665,0001,019,0002,117,632stderr
2Jun 23, 2026 23:559,83988,420,41879,660,0001,022,0002,117,632stderr
3Jun 23, 2026 23:559,85488,432,78679,785,0001,018,0002,117,632stderr
4Jun 23, 2026 23:559,86588,863,84579,874,0001,022,0002,117,632stderr
5Jun 23, 2026 23:559,87888,599,19479,985,0001,019,0002,117,632stderr
6Jun 23, 2026 23:559,88788,701,77780,058,0001,019,0002,117,632stderr
7Jun 23, 2026 23:559,89888,791,26680,150,0001,018,0002,117,632stderr
8Jun 23, 2026 23:559,90188,790,71880,170,0001,021,0002,117,632stderr
9Jun 23, 2026 23:559,91888,962,20680,314,0001,018,0002,117,632stderr