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 10, 2022 04:57Yuriy LyfenkoYuriy LyfenkoScore: 12,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 04:5712,855412,316,388106,699,31902,277,376
2Jan 10, 2022 04:5712,865425,219,502106,781,20302,256,896
3Jan 10, 2022 04:5712,866415,059,226106,788,16702,252,800