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 22:19Dominique GarmierDominique GarmierScore: 117,721Success
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 22:1985,257725,284,204699,111,00002,379,776
2Mar 29, 2026 22:19117,721989,864,365963,313,0002,000,0002,379,776
3Mar 29, 2026 22:19118,244998,637,133968,604,000999,0002,363,392