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 19, 2026 04:29wnwnScore: 3,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 04:293,72351,278,03228,907,0001,993,0002,494,464
2Apr 19, 2026 04:293,72952,491,02628,951,0001,996,0002,531,328
3Apr 19, 2026 04:293,95660,181,51031,842,000995,0002,498,560