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 listMar 20, 2026 18:01olliecrowolliecrowScore: 101,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 18:01100,72265,514,32535,253,0002,014,0002,449,408
2Mar 20, 2026 18:01101,06258,238,64934,362,0003,031,0002,441,216
3Mar 20, 2026 18:01102,60067,863,32334,965,0002,997,0002,449,408