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 30, 2026 10:22Dominique GarmierDominique GarmierScore: 164,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 10:22163,4181,372,163,2621,338,032,0001,998,0002,408,448
2Mar 30, 2026 10:22164,7281,378,474,6491,346,772,0003,999,0002,461,696
3Mar 30, 2026 10:22416,2143,445,519,1533,410,957,0001,998,0002,285,568