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:25wnwnScore: 3,617Success
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:263,40747,777,40827,273,0001,010,0002,482,176
2Apr 27, 2026 10:263,58348,957,64327,764,0001,983,0002,330,624
3Apr 27, 2026 10:263,60045,126,13927,894,0001,992,0002,482,176
4Apr 27, 2026 10:263,61647,048,26728,016,0002,001,0002,551,808
5Apr 27, 2026 10:263,61755,611,44728,027,0002,001,0002,494,464
6Apr 27, 2026 10:263,62047,802,51628,049,0002,003,0002,478,080
7Apr 27, 2026 10:263,62350,129,23429,074,0001,002,0002,478,080
8Apr 27, 2026 10:263,63445,347,91329,165,0001,005,0002,490,368
9Apr 27, 2026 10:263,64049,065,10429,210,0001,007,0002,330,624