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 14, 2026 02:17Victor MerckléVictor MerckléScore: 7,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 02:177,35968,348,13160,083,0001,001,0002,113,536
2May 14, 2026 02:177,35970,612,02261,087,00002,113,536
3May 14, 2026 02:177,36569,408,77760,089,0001,045,0002,113,536
4May 14, 2026 02:177,37468,442,32061,210,00002,113,536
5May 14, 2026 02:177,41569,279,61761,551,00002,113,536
6May 14, 2026 02:177,41970,598,85660,571,0001,011,0002,113,536
7May 14, 2026 02:177,42171,198,73561,596,00002,113,536
8May 14, 2026 02:177,42472,263,22760,626,0001,001,0002,113,536
9May 14, 2026 02:177,42775,433,81060,629,0001,016,0002,113,536