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 8, 2026 09:25Victor MerckléVictor MerckléScore: 2,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 09:292,73930,800,93322,461,000024,576stderr
2Sep 8, 2026 09:292,74430,786,34822,506,000024,576stderr
3Sep 8, 2026 09:292,74930,801,55122,549,000024,576stderr
4Sep 8, 2026 09:292,75030,884,34622,552,000024,576stderr
5Sep 8, 2026 09:292,75530,952,75122,598,000024,576stderr
6Sep 8, 2026 09:292,75730,994,36722,615,000024,576stderr
7Sep 8, 2026 09:292,75830,968,42622,616,000024,576stderr
8Sep 8, 2026 09:292,76830,982,81722,705,000024,576stderr
9Sep 8, 2026 09:295,77255,738,30446,322,0001,014,00024,576stderr