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 19, 2026 14:13Victor MerckléVictor MerckléScore: 6,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:136,14060,556,91549,935,0001,034,0002,113,536
2May 19, 2026 14:136,15460,608,05050,061,0001,019,0002,113,536
3May 19, 2026 14:136,17360,809,86050,210,0001,031,0002,113,536
4May 19, 2026 14:136,17759,046,43850,250,0001,027,0002,113,536
5May 19, 2026 14:136,18960,877,70950,356,0001,014,0002,113,536
6May 19, 2026 14:136,22560,192,29450,635,0001,034,0002,113,536
7May 19, 2026 14:136,28760,733,88051,160,0001,024,0002,113,536
8May 19, 2026 14:136,32561,967,78151,477,0001,024,0002,113,536
9May 19, 2026 14:136,37263,691,96351,890,0001,002,0002,113,536