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 17:38olliecrowolliecrowScore: 101,527Success
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 17:38100,64966,961,55634,221,0003,019,0002,449,408
2Mar 20, 2026 17:38101,52767,200,10536,550,0001,015,0002,445,312
3Mar 20, 2026 17:38106,53270,868,43135,476,0003,941,0002,445,312