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 24, 2026 20:23Dominique GarmierDominique GarmierScore: 219,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 20:23218,900106,434,09078,994,0001,999,0002,334,720
2Mar 24, 2026 20:23219,038112,785,56079,043,0002,001,0002,334,720
3Mar 24, 2026 20:23219,268107,971,71278,125,0003,004,0002,547,712