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 listSep 8, 2021 22:15Yurkov AlekseyYurkov AlekseyScore: 31,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2021 22:1631,793330,025,435263,885,31002,289,664
2Sep 8, 2021 22:1631,809325,427,034264,011,67502,285,568
3Sep 8, 2021 22:1631,827318,385,827264,163,87602,285,568
4Sep 8, 2021 22:1531,836330,837,121264,237,07502,285,568
5Sep 8, 2021 22:1531,866329,361,260264,487,93102,293,760
6Sep 8, 2021 22:1531,974344,346,355265,384,68602,281,472