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 listFeb 1, 2025 17:54spacecat8086spacecat8086Score: 104,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 17:54101,704859,519,116695,143,000138,828,0002,523,136
2Feb 1, 2025 17:54104,130881,432,556712,055,000141,811,0002,281,472
3Feb 1, 2025 17:54143,2361,200,432,1941,036,706,000137,827,0002,310,144