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 16, 2022 21:15Yuriy LyfenkoYuriy LyfenkoScore: 31,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 21:1531,543315,857,938261,807,92502,281,472
2Jan 16, 2022 21:1531,572319,677,100262,048,17802,281,472
3Jan 16, 2022 21:1531,581320,051,511262,125,13402,277,376