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 listJun 5, 2025 13:47limanjun99limanjun99Score: 64,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2025 13:4764,836562,148,565473,122,00065,016,0002,379,776
2Jun 5, 2025 13:4764,839560,048,019479,144,00059,017,0002,269,184
3Jun 5, 2025 13:4764,894568,944,360470,542,00068,078,0002,269,184
4Jun 5, 2025 13:4764,899566,103,021455,715,00082,948,0002,269,184
5Jun 5, 2025 13:4764,990568,994,441476,369,00063,048,0002,269,184
6Jun 5, 2025 13:4765,028568,938,460479,766,00059,970,0002,371,584
7Jun 5, 2025 13:4765,039562,159,520465,845,00073,975,0002,375,680
8Jun 5, 2025 13:4765,089565,370,093479,213,00061,027,0002,383,872
9Jun 5, 2025 13:4765,175561,326,665483,960,00056,995,0002,269,184