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 listApr 11, 2025 20:46Yuriy LyfenkoYuriy LyfenkoScore: 59,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 20:4659,324542,410,59619,955,0001,995,0002,269,184
2Apr 11, 2025 20:4659,451543,283,58219,998,0001,999,0002,265,088
3Apr 11, 2025 20:4659,592543,437,49520,045,0002,004,0002,269,184