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 26, 2026 16:01wnwnScore: 3,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:013,41047,419,69927,300,0001,011,0002,330,624
2Apr 26, 2026 16:013,42942,628,64428,465,00002,498,560
3Apr 26, 2026 16:013,44042,744,67327,535,0001,019,0002,490,368
4Apr 26, 2026 16:013,48845,273,56626,959,0001,996,0002,494,464
5Apr 26, 2026 16:013,49142,790,55426,984,0001,998,0002,482,176
6Apr 26, 2026 16:013,53445,471,48728,326,0001,011,0002,494,464
7Apr 26, 2026 16:013,55950,330,48328,524,0001,018,0002,482,176
8Apr 26, 2026 16:013,74948,781,14729,111,0002,007,0002,334,720
9Apr 26, 2026 16:014,02148,537,49732,369,0001,011,0002,490,368