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 18, 2025 01:48Chandrasekaran AkashChandrasekaran AkashScore: 63,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 01:4863,68946,944,07823,565,00002,531,328
2Apr 18, 2025 01:4863,78147,933,63522,573,0001,026,0002,531,328
3Apr 18, 2025 01:4863,80347,977,26822,581,0001,026,0002,445,312