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 27, 2026 12:43Victor MerckléVictor MerckléScore: 4,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:444,48645,385,31136,080,0001,156,0002,113,536
2Aug 27, 2026 12:444,52946,618,96536,479,0001,112,0002,113,536
3Aug 27, 2026 12:444,53345,949,38536,500,0001,132,0002,113,536
4Aug 27, 2026 12:444,53845,911,59136,537,0001,135,0002,113,536
5Aug 27, 2026 12:444,55846,087,07936,740,0001,092,0002,113,536
6Aug 27, 2026 12:444,55946,176,70936,701,0001,141,0002,113,536
7Aug 27, 2026 12:444,56646,134,47136,856,0001,048,0002,113,536
8Aug 27, 2026 12:444,58546,373,76736,986,0001,074,0002,113,536
9Aug 27, 2026 12:444,59446,489,31737,011,0001,124,0002,113,536