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 3, 2026 15:32wnwnScore: 3,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 15:343,32843,414,01826,582,0001,043,0002,490,368
2May 3, 2026 15:343,33744,532,79326,639,0001,065,0002,494,464
3May 3, 2026 15:343,39943,095,77127,160,0001,056,0002,478,080
4May 3, 2026 15:343,44742,779,38127,540,0001,078,0002,473,984
5May 3, 2026 15:343,47543,795,56427,748,0001,100,0002,486,272
6May 3, 2026 15:343,54845,803,47428,379,0001,077,0002,478,080
7May 3, 2026 15:343,56546,258,55428,521,0001,071,0002,494,464
8May 3, 2026 15:343,58746,648,87528,661,0001,118,0002,482,176
9May 3, 2026 15:343,60945,079,14428,862,0001,097,0002,482,176