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 09:04Chandrasekaran AkashChandrasekaran AkashScore: 62,170Success
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 09:0461,93542,856,96721,920,000996,0002,531,328
2Apr 14, 2025 09:0462,17050,631,52921,003,0002,000,0002,269,184
3Apr 14, 2025 09:0462,18947,095,73222,010,0001,000,0002,527,232