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 25, 2026 00:46Dominique GarmierDominique GarmierScore: 70,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 00:4670,55451,504,44425,101,0001,004,0002,326,528
2Mar 25, 2026 00:4670,64944,929,87724,130,0002,010,0002,289,664
3Mar 25, 2026 00:4670,88952,902,70924,212,0002,017,0002,326,528