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 listMay 10, 2026 11:05wnwnScore: 4,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:054,35953,774,28635,138,0001,047,0002,486,272
2May 10, 2026 11:054,38254,253,54335,272,0001,102,0002,490,368
3May 10, 2026 11:054,43953,437,26835,774,0001,070,0002,482,176
4May 10, 2026 11:054,52656,641,38336,497,0001,072,0002,486,272
5May 10, 2026 11:054,52851,708,42536,540,0001,046,0002,494,464
6May 10, 2026 11:054,52851,969,10436,529,0001,055,0002,478,080
7May 10, 2026 11:054,53356,034,70936,544,0001,082,0002,482,176
8May 10, 2026 11:054,53354,659,96636,549,0001,083,0002,478,080
9May 10, 2026 11:054,55656,054,86136,720,0001,100,0002,469,888