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 14, 2025 12:17Yuriy LyfenkoYuriy LyfenkoScore: 59,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 12:1759,200545,092,76519,913,0001,991,0002,527,232
2Apr 14, 2025 12:1759,381549,050,31420,973,000998,0002,531,328
3Apr 14, 2025 12:1759,595540,498,68220,046,0002,004,0002,531,328