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 02:30wnwnScore: 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 02:303,41041,040,48627,293,0001,010,0002,490,368
2Apr 27, 2026 02:303,42843,233,49227,443,0001,016,0002,330,624
3Apr 27, 2026 02:303,45642,766,25426,708,0001,978,0002,486,272
4Apr 27, 2026 02:303,46243,556,02326,755,0001,981,0002,547,712
5Apr 27, 2026 02:303,46449,254,87826,774,0001,983,0002,486,272
6Apr 27, 2026 02:303,48043,327,00026,893,0001,992,0002,494,464
7Apr 27, 2026 02:303,49150,155,33127,978,000999,0002,486,272
8Apr 27, 2026 02:303,54046,582,03628,369,0001,013,0002,486,272
9Apr 27, 2026 02:303,65047,590,83129,290,0001,010,0002,478,080