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:44Chandrasekaran AkashChandrasekaran AkashScore: 65,124Success
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:4465,12454,215,00022,088,0002,008,0002,449,408
2Apr 18, 2025 00:4465,12451,122,86022,088,0002,008,0002,449,408
3Apr 18, 2025 00:4466,03547,919,10523,415,0001,018,0002,445,312