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 listMay 13, 2026 14:25Victor MerckléVictor MerckléScore: 7,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 14:267,88373,337,57364,423,0001,014,0002,113,536
2May 13, 2026 14:267,88474,621,28164,443,0001,002,0002,113,536
3May 13, 2026 14:267,88872,806,35365,474,00002,113,536
4May 13, 2026 14:267,89374,276,40464,499,0001,020,0002,113,536
5May 13, 2026 14:267,89375,431,71264,464,0001,048,0002,113,536
6May 13, 2026 14:267,89677,699,35164,519,0001,018,0002,113,536
7May 13, 2026 14:267,89774,387,23964,549,0001,002,0002,113,536
8May 13, 2026 14:267,90172,929,33264,537,0001,047,0002,113,536
9May 13, 2026 14:267,94275,197,02064,922,0001,000,0002,113,536