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 31, 2026 09:42Dominique GarmierDominique GarmierScore: 12,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 09:423,52758,756,02327,927,000997,0002,400,256
2Mar 31, 2026 09:4212,977133,989,673101,396,0005,019,0002,494,464
3Mar 31, 2026 09:4213,017138,129,954104,741,0001,995,0002,379,776