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 listSep 6, 2026 08:56Kevin HeaveyKevin HeaveyScore: 3,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 08:573,50940,590,55627,885,0001,246,0002,113,536
2Sep 6, 2026 08:573,51539,117,29028,130,0001,045,0002,113,536
3Sep 6, 2026 08:573,51837,554,14328,013,0001,188,0002,113,536
4Sep 6, 2026 08:573,52440,989,70528,204,0001,051,0002,113,536
5Sep 6, 2026 08:573,52637,815,97428,224,0001,047,0002,113,536
6Sep 6, 2026 08:573,54139,880,81028,155,0001,243,0002,113,536
7Sep 6, 2026 08:573,56338,768,61028,498,0001,080,0002,113,536
8Sep 6, 2026 08:573,56639,745,03328,473,0001,130,0002,113,536
9Sep 6, 2026 08:573,83841,706,54330,811,0001,051,0002,113,536