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 04:45wnwnScore: 3,474Success
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 04:453,38640,730,93426,104,0002,008,0002,490,368
2Apr 27, 2026 04:453,39246,239,03826,145,0002,011,0002,486,272
3Apr 27, 2026 04:453,45046,438,20427,620,0001,022,0002,490,368
4Apr 27, 2026 04:453,46646,515,75326,791,0001,984,0002,330,624
5Apr 27, 2026 04:453,47441,741,56826,849,0001,988,0002,490,368
6Apr 27, 2026 04:453,48244,053,37726,908,0001,993,0002,498,560
7Apr 27, 2026 04:453,48448,507,25826,926,0001,994,0002,494,464
8Apr 27, 2026 04:453,52548,485,06429,264,00002,486,272
9Apr 27, 2026 04:453,60345,576,97427,919,0001,994,0002,482,176