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 listMay 22, 2024 19:52CemaCemaScore: 466,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 19:52464,630236,917,761171,912,98502,260,992
2May 22, 2024 19:52466,231232,660,417172,505,63202,265,088
3May 22, 2024 19:52468,504242,038,146173,346,38302,265,088