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 00:13Yuriy LyfenkoYuriy LyfenkoScore: 30,738Success
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 00:1030,718327,393,358254,962,84902,228,224
2Jan 17, 2022 00:1030,718336,683,439254,960,67702,211,840
3Jan 17, 2022 00:1330,723323,584,572254,997,59602,220,032
4Jan 17, 2022 00:1330,738317,172,273255,124,58602,207,744
5Jan 17, 2022 00:1030,739317,466,825255,137,59802,228,224
6Jan 17, 2022 00:1330,748318,892,663255,206,55002,211,840