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:08Chandrasekaran AkashChandrasekaran AkashScore: 61,081Success
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:0860,93247,834,34421,521,0001,024,0002,531,328
2Apr 18, 2025 02:0861,08158,082,76822,600,00002,449,408
3Apr 18, 2025 02:0861,14349,755,62521,595,0001,028,0002,445,312