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 18:41marko1597marko1597Score: 4,602Success
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 18:434,56346,242,65236,717,0001,162,0002,113,536
2Aug 16, 2026 18:434,57046,283,78836,784,0001,151,0002,113,536
3Aug 16, 2026 18:434,57446,331,40436,809,0001,163,0002,113,536
4Aug 16, 2026 18:434,59846,532,26437,000,0001,165,0002,113,536
5Aug 16, 2026 18:434,60246,615,25337,038,0001,163,0002,113,536
6Aug 16, 2026 18:434,64847,540,51537,421,0001,162,0002,113,536
7Aug 16, 2026 18:434,64948,301,08237,542,0001,046,0002,113,536
8Aug 16, 2026 18:434,65046,973,05037,556,0001,041,0002,113,536
9Aug 16, 2026 18:434,75047,851,34238,386,0001,046,0002,113,536