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 listJun 29, 2026 11:16Adam FolwarcznyAdam FolwarcznyScore: 11,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 11:1711,446104,345,52091,934,0003,076,0002,113,536
2Jun 29, 2026 11:1711,459104,440,97391,992,0003,125,0002,113,536
3Jun 29, 2026 11:1711,538105,152,99392,696,0003,070,0002,113,536
4Jun 29, 2026 11:1711,544105,183,22392,768,0003,052,0002,113,536
5Jun 29, 2026 11:1711,547105,233,97692,761,0003,086,0002,113,536
6Jun 29, 2026 11:1711,550105,307,89692,775,0003,091,0002,113,536
7Jun 29, 2026 11:1711,572105,406,83492,973,0003,077,0002,113,536
8Jun 29, 2026 11:1711,650106,071,97293,544,0003,159,0002,113,536
9Jun 29, 2026 11:1711,672106,285,82393,804,0003,080,0002,113,536