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 08:45Victor MerckléVictor MerckléScore: 3,006Success
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 08:472,94732,470,39623,102,0001,069,0002,117,632stderr
2Aug 19, 2026 08:472,96532,699,44522,237,0002,078,0002,117,632stderr
3Aug 19, 2026 08:472,98533,928,44522,388,0002,092,0002,117,632stderr
4Aug 19, 2026 08:472,98633,455,98323,447,0001,041,0002,117,632stderr
5Aug 19, 2026 08:473,00632,988,08223,615,0001,036,0002,117,632stderr
6Aug 19, 2026 08:473,03733,216,36523,850,0001,058,0002,117,632stderr
7Aug 19, 2026 08:473,07633,490,86124,185,0001,041,0002,117,632stderr
8Aug 19, 2026 08:475,51853,557,85044,222,0001,030,0002,117,632stderr
9Aug 19, 2026 08:475,52654,243,49744,291,0001,026,0002,117,632stderr