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 19:10Dominique GarmierDominique GarmierScore: 10,022Success
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 19:1010,021104,218,96281,170,0001,002,0002,535,424
2Mar 24, 2026 19:1010,022109,499,68179,172,0003,006,0002,469,888
3Mar 24, 2026 19:1010,061105,807,35780,488,0002,012,0002,334,720