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 listOct 15, 2024 23:44zielajzielajScore: 99,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 23:4486,837735,637,338583,234,000128,830,0002,400,256
2Oct 15, 2024 23:4499,853847,834,420693,829,000124,969,0002,273,280
3Oct 15, 2024 23:44103,070869,955,710728,286,000116,885,0002,334,720