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 05:54Chandrasekaran AkashChandrasekaran AkashScore: 67,746Success
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 05:5467,60350,137,40624,013,0001,000,0002,531,328
2Apr 14, 2025 05:5467,74647,715,35524,064,0001,002,0002,449,408
3Apr 14, 2025 05:5468,08651,322,20923,177,0002,015,0002,445,312