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 9, 2026 13:37wnwnScore: 3,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 13:373,57144,926,85728,568,0001,076,0002,490,368
2May 9, 2026 13:373,61944,113,14829,006,0001,036,0002,482,176
3May 9, 2026 13:373,62145,554,94828,996,0001,066,0002,494,464
4May 9, 2026 13:373,62246,223,35029,008,0001,058,0002,490,368
5May 9, 2026 13:373,62942,756,65929,080,0001,042,0002,482,176
6May 9, 2026 13:373,71744,377,84529,784,0001,068,0002,482,176
7May 9, 2026 13:373,75649,222,84030,098,0001,079,0002,490,368
8May 9, 2026 13:373,78048,455,58130,290,0001,086,0002,498,560
9May 9, 2026 13:373,80348,920,41130,484,0001,086,0002,490,368