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:56Chandrasekaran AkashChandrasekaran AkashScore: 62,381Success
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:5662,17348,355,88621,004,0002,000,0002,441,216
2Apr 18, 2025 00:5662,38147,419,41921,074,0002,007,0002,531,328
3Apr 18, 2025 00:5662,47347,270,53322,110,0001,005,0002,441,216