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 listMar 21, 2026 08:43olliecrowolliecrowScore: 5,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 08:465,79569,504,64045,091,0003,006,0002,469,888
2Mar 21, 2026 08:435,81969,989,81644,272,0004,024,0002,486,272
3Mar 21, 2026 08:465,93671,515,38247,258,0002,011,0002,424,832
4Mar 21, 2026 08:435,94370,330,63946,304,0003,019,0002,428,928
5Mar 21, 2026 08:465,97778,626,34748,601,0001,012,0002,326,528
6Mar 21, 2026 08:436,08967,125,92348,515,0002,021,0002,310,144