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 listJul 5, 2021 15:58Yuriy LyfenkoYuriy LyfenkoScore: 36,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2021 15:5536,846358,748,937305,821,87102,220,032
2Jul 5, 2021 15:5536,856376,367,726305,901,15702,224,128
3Jul 5, 2021 15:5836,856365,098,817305,902,01702,215,936
4Jul 5, 2021 15:5836,859394,200,054305,927,81502,211,840
5Jul 5, 2021 15:5536,861359,375,803305,944,00802,224,128
6Jul 5, 2021 15:5836,877369,779,685306,081,31702,211,840