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 listMar 24, 2026 07:30Dominique GarmierDominique GarmierScore: 20,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 07:3019,908190,747,42680,626,00082,616,0002,383,872
2Mar 24, 2026 07:3020,018192,922,19379,586,00084,560,0002,461,696
3Mar 24, 2026 07:3020,084192,025,62481,844,00082,842,0002,478,080