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:30PhibPhibScore: 2,018,105Success
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:301,948,798774,309,407721,055,20702,289,664
2Sep 30, 2022 20:302,018,105813,005,771746,699,03302,289,664
3Sep 30, 2022 20:302,215,086887,180,263819,581,99702,293,760