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 27, 2026 10:08wnwnScore: 3,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:083,40443,985,00527,246,0001,009,0002,490,368
2Apr 27, 2026 10:083,41045,116,94227,300,0001,011,0002,482,176
3Apr 27, 2026 10:083,43847,656,85727,519,0001,019,0002,490,368
4Apr 27, 2026 10:083,46342,491,50727,717,0001,026,0002,490,368
5Apr 27, 2026 10:083,46445,531,62827,731,0001,027,0002,486,272
6Apr 27, 2026 10:083,46745,087,00026,799,0001,985,0002,330,624
7Apr 27, 2026 10:083,47447,161,59226,850,0001,988,0002,494,464
8Apr 27, 2026 10:083,60847,743,04127,951,0001,996,0002,330,624
9Apr 27, 2026 10:083,61645,565,67128,016,0002,001,0002,494,464