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:53spacecat8086spacecat8086Score: 138,849Success
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:53120,2421,008,403,922846,130,000139,856,0002,301,952
2Feb 1, 2025 17:53138,8491,164,100,957993,746,000144,817,0002,510,848
3Feb 1, 2025 17:53143,0001,196,358,8161,032,765,000139,832,0002,273,280