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 06:41Chandrasekaran AkashChandrasekaran AkashScore: 66,549Success
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 06:4166,43251,061,74723,556,0001,024,0002,527,232
2Apr 14, 2025 06:4166,54951,122,65724,623,00002,531,328
3Apr 14, 2025 06:4166,82249,824,79724,724,00002,269,184