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 23, 2026 05:17Dominique GarmierDominique GarmierScore: 19,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 05:1719,601191,330,915114,807,00045,923,0002,506,752
2Mar 23, 2026 05:1719,741191,179,107114,910,00046,963,0002,379,776
3Mar 23, 2026 05:1719,838188,892,554114,767,00047,903,0002,306,048