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:10Chandrasekaran AkashChandrasekaran AkashScore: 62,295Success
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:1062,26241,175,66521,034,0002,003,0002,445,312
2Apr 18, 2025 01:1062,29543,653,35522,047,0001,002,0002,453,504
3Apr 18, 2025 01:1062,42448,324,65721,089,0002,008,0002,441,216