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 16, 2026 08:11marko1597marko1597Score: 2,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 08:482,82531,477,28422,017,0001,156,0002,117,632stderr
2Aug 16, 2026 08:482,83431,543,38022,086,0001,157,0002,117,632stderr
3Aug 16, 2026 08:482,83531,540,12222,083,0001,167,0002,117,632stderr
4Aug 16, 2026 08:482,84631,606,74522,163,0001,180,0002,117,632stderr
5Aug 16, 2026 08:482,85031,726,85422,196,0001,175,0002,117,632stderr
6Aug 16, 2026 08:482,86031,792,27222,251,0001,202,0002,117,632stderr
7Aug 16, 2026 08:482,93132,352,72322,831,0001,205,0002,117,632stderr
8Aug 16, 2026 08:487,44869,409,06959,936,0001,145,0002,117,632stderr
9Aug 16, 2026 08:487,46169,581,38360,045,0001,136,0002,117,632stderr