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 listApr 22, 2026 17:40olliecrowolliecrowScore: 18,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 17:4118,914169,074,661154,098,0001,000,0002,510,848
2Apr 22, 2026 17:4118,918171,293,008154,135,0001,000,0002,523,136
3Apr 22, 2026 17:4118,924172,285,379153,175,0002,002,0002,514,944
4Apr 22, 2026 17:4118,925173,944,674154,185,0001,001,0002,498,560
5Apr 22, 2026 17:4118,927176,278,689154,206,0001,001,0002,523,136
6Apr 22, 2026 17:4118,930175,575,211154,230,0001,001,0002,527,232
7Apr 22, 2026 17:4118,934173,334,812154,265,0001,001,0002,519,040
8Apr 22, 2026 17:4118,934170,462,160154,264,0001,001,0002,469,888
9Apr 22, 2026 17:4118,950168,872,893154,394,0001,002,0002,334,720