Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 14, 2026 17:42marko1597marko1597Score: 6,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:436,17361,293,80850,082,0001,161,0002,113,536
2Aug 14, 2026 17:436,17461,307,93550,073,0001,178,0002,113,536
3Aug 14, 2026 17:436,17661,262,89250,123,0001,144,0002,113,536
4Aug 14, 2026 17:436,17661,206,77150,124,0001,142,0002,113,536
5Aug 14, 2026 17:436,17761,285,36850,110,0001,160,0002,113,536
6Aug 14, 2026 17:436,17761,317,43050,120,0001,152,0002,113,536
7Aug 14, 2026 17:436,17861,270,43050,140,0001,139,0002,113,536
8Aug 14, 2026 17:436,45563,563,81752,426,0001,158,0002,113,536
9Aug 14, 2026 17:436,53664,853,99053,104,0001,153,0002,113,536