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 listOct 16, 2024 23:46Joad NacerJoad NacerScore: 4,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 23:464,47658,860,31035,140,0002,008,0002,535,424
2Oct 16, 2024 23:464,52259,065,75737,534,00002,301,952
3Oct 16, 2024 23:464,55965,335,48135,845,0001,991,0002,301,952
4Oct 16, 2024 23:464,56068,021,16436,852,000996,0002,535,424
5Oct 16, 2024 23:464,56162,799,10236,858,000996,0002,293,760
6Oct 16, 2024 23:464,57259,784,72335,949,0001,997,0002,297,856
7Oct 16, 2024 23:464,57665,995,37234,985,0002,998,0002,301,952
8Oct 16, 2024 23:464,60865,875,67436,233,0002,012,0002,269,184
9Oct 16, 2024 23:464,61360,306,81037,278,0001,007,0002,301,952
10Oct 16, 2024 23:464,62260,892,73036,344,0002,019,0002,531,328
11Oct 16, 2024 23:464,63061,315,71537,419,0001,011,0002,301,952
12Oct 16, 2024 23:464,63460,324,44437,453,0001,012,0002,531,328