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 listJan 17, 2022 05:20Yuriy LyfenkoYuriy LyfenkoScore: 30,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 05:2030,927324,231,129256,694,15902,211,840
2Jan 17, 2022 05:2030,949325,470,843256,877,25002,215,936
3Jan 17, 2022 05:2030,956320,343,369256,936,22602,220,032