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 16, 2026 13:17marko1597marko1597Score: 5,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:415,43055,464,51043,930,0001,145,0002,113,536
2Aug 16, 2026 13:415,43255,082,28843,938,0001,150,0002,113,536
3Aug 16, 2026 13:415,43355,088,56243,951,0001,144,0002,113,536
4Aug 16, 2026 13:415,45055,234,59444,110,0001,132,0002,113,536
5Aug 16, 2026 13:415,45055,241,76644,104,0001,134,0002,113,536
6Aug 16, 2026 13:415,50355,691,08544,498,0001,177,0002,113,536
7Aug 16, 2026 13:415,53255,934,20344,767,0001,150,0002,113,536
8Aug 16, 2026 13:415,56356,191,79145,035,0001,144,0002,113,536
9Aug 16, 2026 13:415,61256,606,05745,447,0001,137,0002,113,536