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 21, 2026 16:47izotoffizotoffScore: 117,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:47116,90368,556,70241,243,0002,011,0002,396,160
2Mar 21, 2026 16:47117,38178,409,50541,411,0002,020,0002,392,064
3Mar 21, 2026 16:47117,70567,930,09142,539,0001,012,0002,383,872