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 14, 2021 19:30Yuriy LyfenkoYuriy LyfenkoScore: 19,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2021 19:3019,105188,534,641158,571,00002,396,160
2May 14, 2021 19:3019,106191,587,539157,574,0001,003,0002,260,992
3May 14, 2021 19:3019,111184,207,309156,625,0001,995,0002,396,160
4May 14, 2021 19:3019,122191,367,845156,713,0001,996,0002,260,992
5May 14, 2021 19:3019,140184,615,814156,862,0001,998,0002,260,992
6May 14, 2021 19:3019,253188,483,855157,806,0001,997,0002,260,992
7May 14, 2021 19:3019,258187,851,616157,841,0001,997,0002,523,136
8May 14, 2021 19:3019,269188,353,492157,935,0001,999,0002,396,160
9May 14, 2021 19:3019,269186,157,442155,938,0003,998,0002,260,992