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 listMay 10, 2026 09:52wnwnScore: 3,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 09:523,41041,889,69127,262,0001,049,0002,486,272
2May 10, 2026 09:523,49044,080,63227,886,0001,086,0002,478,080
3May 10, 2026 09:523,53444,693,18428,268,0001,070,0002,486,272
4May 10, 2026 09:523,57844,823,42128,622,0001,077,0002,490,368
5May 10, 2026 09:523,60047,391,68428,772,0001,113,0002,486,272
6May 10, 2026 09:523,60946,096,91328,869,0001,091,0002,486,272
7May 10, 2026 09:523,62451,390,86128,990,0001,095,0002,486,272
8May 10, 2026 09:523,62743,991,13029,056,0001,055,0002,490,368
9May 10, 2026 09:523,65145,984,34029,173,0001,135,0002,322,432