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 2, 2026 19:16George SeabridgeGeorge SeabridgeScore: 7,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 19:177,43871,689,88459,573,0002,169,0002,113,536
2Aug 2, 2026 19:177,44671,705,52359,598,0002,211,0002,113,536
3Aug 2, 2026 19:177,48772,059,05059,976,0002,170,0002,113,536
4Aug 2, 2026 19:177,51472,550,37660,191,0002,183,0002,113,536
5Aug 2, 2026 19:177,67573,578,85861,674,0002,034,0002,113,536
6Aug 2, 2026 19:177,71774,379,31861,827,0002,231,0002,113,536
7Aug 2, 2026 19:177,74674,203,88062,091,0002,207,0002,113,536
8Aug 2, 2026 19:177,75374,320,61662,117,0002,236,0002,113,536
9Aug 2, 2026 19:177,75674,272,35362,162,0002,220,0002,113,536