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 1, 2026 12:40Pavel SkripkinPavel SkripkinScore: 105,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 12:4085,104714,724,880552,888,000144,970,0002,363,392
2May 1, 2026 12:40105,128879,759,194722,204,000139,846,0002,461,696
3May 1, 2026 12:40110,274920,873,412765,369,000138,885,0002,465,792