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 15, 2026 22:21Dominique GarmierDominique GarmierScore: 72,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:2172,54152,385,39625,808,0001,032,0002,396,160
2Mar 15, 2026 22:2172,76552,034,68324,929,0001,994,0002,273,280
3Mar 15, 2026 22:2173,77652,292,50326,286,0001,011,0002,514,944