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 listApr 10, 2026 10:46Danylo MocherniukDanylo MocherniukScore: 4,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 10:464,90268,349,24438,656,0002,034,0002,392,064
2Apr 10, 2026 10:464,92267,726,32839,859,000996,0002,297,856
3Apr 10, 2026 10:464,93167,107,05138,930,0001,996,0002,297,856
4Apr 10, 2026 10:464,93159,306,76738,928,0001,996,0002,297,856
5Apr 10, 2026 10:464,95161,582,62838,084,0003,006,0002,297,856
6Apr 10, 2026 10:464,95567,409,22539,123,0002,006,0002,297,856
7Apr 10, 2026 10:464,97464,441,62438,266,0003,021,0002,297,856
8Apr 10, 2026 10:465,00166,955,92538,469,0003,037,0002,392,064
9Apr 10, 2026 10:465,18468,305,87141,023,0002,001,0002,392,064