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 listMay 11, 2023 09:23Yevhen KazminYevhen KazminScore: 56,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2023 09:2356,506527,229,372468,997,36402,215,936
2May 11, 2023 09:2356,527542,607,754469,170,77602,232,320
3May 11, 2023 09:2356,532538,680,355469,213,99002,232,320
4May 11, 2023 09:2356,534538,539,480469,230,36602,228,224
5May 11, 2023 09:2356,536529,832,920469,249,04702,236,416
6May 11, 2023 09:2356,562528,318,333469,461,87402,228,224