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 22:53Dominique GarmierDominique GarmierScore: 110,571Success
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 22:53103,345872,367,306710,522,000136,907,0002,387,968
2Mar 22, 2026 22:53110,571936,501,753782,726,000123,956,0002,523,136
3Mar 22, 2026 22:53119,8461,013,935,373852,775,000129,965,0002,420,736