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 listOct 27, 2024 11:04Xushi8Xushi8Score: 2,149,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2024 11:041,863,727712,482,881495,698,000193,881,0002,359,296
2Oct 27, 2024 11:042,149,200819,294,694593,406,000201,798,0002,318,336
3Oct 27, 2024 11:042,173,286833,092,788609,330,000194,786,0002,310,144