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 04:26Chandrasekaran AkashChandrasekaran AkashScore: 61,946Success
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 04:2661,85443,635,60621,891,000995,0002,531,328
2Apr 14, 2025 04:2661,94643,263,72421,924,000996,0002,449,408
3Apr 14, 2025 04:2661,96245,920,84521,930,000996,0002,531,328