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 18, 2025 02:46Chandrasekaran AkashChandrasekaran AkashScore: 61,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 02:4660,96242,889,25722,556,00002,445,312
2Apr 18, 2025 02:4561,04347,520,49821,560,0001,026,0002,531,328
3Apr 18, 2025 02:4561,14147,563,43722,622,00002,531,328
4Apr 18, 2025 02:4661,23045,034,70821,626,0001,029,0002,531,328
5Apr 18, 2025 02:4661,24349,476,21222,660,00002,531,328
6Apr 18, 2025 02:4561,97651,441,10920,937,0001,994,0002,531,328