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 01:28Chandrasekaran AkashChandrasekaran AkashScore: 71,981Success
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 01:2871,59250,119,41226,489,00002,531,328
2Apr 11, 2025 01:2871,98152,561,36526,633,00002,527,232
3Apr 11, 2025 01:2872,71655,620,18924,912,0001,993,0002,269,184