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 15:38Dominique GarmierDominique GarmierScore: 72,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 10:4571,80356,334,69125,546,0001,021,0002,531,328
2Mar 26, 2026 10:4571,94651,856,74325,597,0001,023,0002,277,376
3Mar 25, 2026 15:3872,10550,581,53725,653,0001,026,0002,482,176
4Mar 25, 2026 15:3872,20352,902,92325,688,0001,027,0002,486,272
5Mar 25, 2026 15:3872,77347,836,62024,932,0001,994,0002,277,376
6Mar 26, 2026 10:4575,73856,479,28926,022,0002,001,0002,277,376