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 02:55Chandrasekaran AkashChandrasekaran AkashScore: 61,208Success
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 02:5561,19248,778,70721,612,0001,029,0002,527,232
2Apr 18, 2025 02:5561,20851,232,97122,647,00002,445,312
3Apr 18, 2025 02:5561,34647,328,49221,667,0001,031,0002,441,216