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:40Chandrasekaran AkashChandrasekaran AkashScore: 65,173Success
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:4065,11146,566,44523,088,0001,003,0002,359,296
2Apr 18, 2025 00:4065,17342,562,11122,105,0002,009,0002,523,136
3Apr 18, 2025 00:4065,38947,828,58523,186,0001,008,0002,449,408