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 21, 2026 19:42Dominique GarmierDominique GarmierScore: 42,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:4240,730359,817,962330,986,0002,999,0002,334,720
2Mar 21, 2026 19:4242,155378,694,018343,677,0001,998,0002,379,776
3Mar 21, 2026 19:4242,354369,302,718344,310,0002,994,0002,338,816