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 23:22Dominique GarmierDominique GarmierScore: 13,935Success
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 23:2213,661141,557,713109,019,0003,000,0002,387,968
2Mar 21, 2026 23:2213,935141,450,140111,261,0003,007,0002,334,720
3Mar 21, 2026 23:2214,428154,774,607114,301,0004,010,0002,338,816