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 00:36Chandrasekaran AkashChandrasekaran AkashScore: 64,978Success
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 00:3664,56847,247,97423,890,00002,527,232
2Apr 18, 2025 00:3664,97856,536,84022,039,0002,003,0002,269,184
3Apr 18, 2025 00:3665,32742,557,62422,157,0002,014,0002,445,312