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 listAug 11, 2025 17:32Ian MckibbenIan MckibbenScore: 12,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 17:3012,157124,084,73399,906,000999,0002,433,024
2Aug 11, 2025 17:3012,163120,563,52099,956,000999,0002,269,184
3Aug 11, 2025 17:3012,164127,454,78899,962,000999,0002,428,928
4Aug 11, 2025 17:3012,165124,354,16898,967,0001,999,0002,433,024
5Aug 11, 2025 17:3212,165127,568,18599,968,000999,0002,433,024
6Aug 11, 2025 17:3012,171123,548,08599,023,0002,000,0002,424,832
7Aug 11, 2025 17:3012,171125,710,17099,023,0002,000,0002,428,928
8Aug 11, 2025 17:3012,174121,174,904100,043,0001,000,0002,433,024
9Aug 11, 2025 17:3012,175126,664,13299,052,0002,001,0002,531,328
10Aug 11, 2025 17:3012,184122,177,008100,123,0001,001,0002,433,024
11Aug 11, 2025 17:3212,444122,811,483103,285,00002,424,832
12Aug 11, 2025 17:3212,455123,719,152102,371,0001,003,0002,531,328