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 16:37Yuriy LyfenkoYuriy LyfenkoScore: 36,279Success
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 16:3736,263353,799,098300,979,25402,220,032
2Jul 5, 2021 16:3736,279367,324,930301,116,49502,220,032
3Jul 5, 2021 16:3736,292360,000,089301,221,99502,211,840