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 listMay 10, 2026 00:08Andrii StolitniiAndrii StolitniiScore: 1,002,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 00:09998,3178,205,827,9038,030,814,000155,388,0002,539,520
2May 10, 2026 00:091,002,7258,240,735,2188,065,703,000156,642,0002,539,520
3May 10, 2026 00:091,005,3238,264,098,1338,083,204,000160,446,0002,539,520