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:17Chandrasekaran AkashChandrasekaran AkashScore: 62,103Success
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:1762,02450,530,38020,954,0001,995,0002,531,328
2Apr 18, 2025 01:1762,10351,646,24621,979,000999,0002,441,216
3Apr 18, 2025 01:1762,42450,306,18121,089,0002,008,0002,445,312