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 20, 2026 07:47Dominique GarmierDominique GarmierScore: 13,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 07:4713,075138,994,941104,213,0003,006,0002,342,912
2Mar 20, 2026 07:4713,100130,344,368105,409,0002,007,0002,314,240
3Mar 20, 2026 07:4713,135133,596,271105,715,0001,994,0002,326,528