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 08:11Chandrasekaran AkashChandrasekaran AkashScore: 7,407,235Success
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 08:117,378,7242,760,336,9872,730,128,00002,445,312
2Apr 14, 2025 08:117,407,2352,768,763,3192,739,678,000999,0002,449,408
3Apr 14, 2025 08:117,518,9462,803,387,0282,782,010,00002,531,328