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 21, 2026 20:35Dominique GarmierDominique GarmierScore: 13,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:3513,215143,769,202106,358,0002,006,0002,347,008
2Mar 21, 2026 20:3513,256135,122,485106,704,0001,994,0002,359,296
3Mar 21, 2026 20:3513,361135,513,148107,552,0002,010,0002,375,680