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 09:17Dominique GarmierDominique GarmierScore: 68,209Success
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 09:1768,140587,196,399556,750,0001,999,0002,453,504
2Mar 22, 2026 09:1768,209586,944,873558,313,0001,000,0002,408,448
3Mar 22, 2026 09:1768,429583,239,491560,121,0001,000,0002,318,336