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 listOct 17, 2021 12:44Mikhail ShirokovMikhail ShirokovScore: 46,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2021 12:4446,748459,233,965388,007,65002,265,088
2Oct 17, 2021 12:4546,753464,921,236388,053,57802,260,992
3Oct 17, 2021 12:4546,775448,219,233388,230,65802,260,992
4Oct 17, 2021 12:4446,806462,893,627388,492,21102,273,280
5Oct 17, 2021 12:4446,816445,519,523388,572,63702,260,992
6Oct 17, 2021 12:4546,830461,762,018388,692,81802,265,088