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 listSep 23, 2026 18:26Matthias GörgensMatthias GörgensScore: 72,189Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 18:2671,74036,974,65125,315,0001,229,0002,113,536
2Sep 23, 2026 18:2672,18937,878,91525,483,0001,227,0002,113,536
3Sep 23, 2026 18:2673,80237,858,41226,084,0001,223,0002,113,536