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 06:33Dominique GarmierDominique GarmierScore: 10,506Success
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 06:3310,421111,235,34185,449,00002,297,856
2Mar 24, 2026 06:3310,506114,687,92184,143,0002,003,0002,387,968
3Mar 24, 2026 06:3310,536107,431,94585,394,0001,004,0002,420,736