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 29, 2026 13:17Dominique GarmierDominique GarmierScore: 8,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 13:178,14090,687,30116,936,00049,814,0002,387,968
2Mar 29, 2026 13:178,23698,974,30926,207,00041,327,0002,494,464
3Mar 29, 2026 13:1717,593170,911,80499,179,00045,081,0002,318,336