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 listJun 5, 2026 10:51IlyaIlyaScore: 1,002,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 10:511,000,4898,213,833,5828,050,938,000153,075,0002,113,536
2Jun 5, 2026 10:511,002,3298,228,665,2818,064,898,000154,205,0002,113,536
3Jun 5, 2026 10:511,011,9558,308,028,5138,146,685,000151,347,0002,113,536