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 2, 2021 12:45Vitaliy F.Vitaliy F.Score: 71,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2021 12:4571,453644,622,707593,059,52002,203,648
2Jul 2, 2021 12:4571,476658,550,488593,248,93702,207,744
3Jul 2, 2021 12:4571,481652,350,082593,293,23202,207,744
4Jul 2, 2021 12:4571,484655,739,787593,317,51002,207,744
5Jul 2, 2021 12:4571,485644,270,309593,325,62202,199,552
6Jul 2, 2021 12:4571,485651,687,736593,328,88202,203,648