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:30Chandrasekaran AkashChandrasekaran AkashScore: 66,454Success
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:2266,29548,039,73923,507,0001,022,0002,531,328
2Apr 14, 2025 06:2266,41948,042,74824,575,00002,527,232
3Apr 14, 2025 06:3066,43848,373,55824,582,00002,449,408
4Apr 14, 2025 06:3066,45449,966,60524,588,00002,531,328
5Apr 14, 2025 06:3066,58452,643,96423,610,0001,026,0002,531,328
6Apr 14, 2025 06:2266,65451,966,54624,662,00002,531,328