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 11, 2025 00:54Chandrasekaran AkashChandrasekaran AkashScore: 6,836,970Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 00:546,794,3032,540,730,6992,512,893,000999,0002,449,408
2Apr 11, 2025 00:546,836,9702,556,066,0632,527,681,0001,998,0002,449,408
3Apr 11, 2025 00:546,914,7412,588,334,7162,556,456,0001,998,0002,269,184