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 12, 2026 15:59Kevin HeaveyKevin HeaveyScore: 3,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 16:003,56338,373,72228,473,0001,103,0002,113,536
2Sep 12, 2026 16:003,56438,413,98528,546,0001,036,0002,113,536
3Sep 12, 2026 16:003,57438,603,66328,538,0001,128,0002,113,536
4Sep 12, 2026 16:003,68039,369,82329,505,0001,045,0002,113,536
5Sep 12, 2026 16:003,72939,787,37129,712,0001,243,0002,113,536
6Sep 12, 2026 16:003,81340,406,51030,613,0001,041,0002,113,536
7Sep 12, 2026 16:003,81340,430,69830,416,0001,237,0002,113,536
8Sep 12, 2026 16:003,81740,490,23330,511,0001,171,0002,113,536
9Sep 12, 2026 16:003,86740,994,90330,877,0001,224,0002,113,536