TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listSep 30, 2022 20:35PhibPhibScore: 1,620,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2022 20:351,581,474642,535,555585,145,42002,314,240
2Sep 30, 2022 20:351,620,495663,896,585599,583,24102,265,088
3Sep 30, 2022 20:351,977,207803,723,049731,566,51802,260,992