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 04:12Chandrasekaran AkashChandrasekaran AkashScore: 67,581Success
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 04:1267,51945,725,67822,984,0001,998,0002,445,312
2Apr 14, 2025 04:1267,58149,029,86924,005,0001,000,0002,445,312
3Apr 14, 2025 04:1267,61951,284,06124,019,0001,000,0002,531,328