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 22, 2026 11:33Dominique GarmierDominique GarmierScore: 17,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 11:3317,954171,672,191146,224,0001,001,0002,293,760
2Mar 22, 2026 11:3317,957168,243,725146,247,0001,001,0002,293,760
3Mar 22, 2026 11:3317,958176,348,861146,258,0001,001,0002,289,664