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 19, 2022 16:37Kyle SoskinKyle SoskinScore: 192,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2022 16:37192,7171,663,298,3571,599,550,00902,211,840
2Oct 19, 2022 16:37192,7991,665,525,1031,600,232,21002,195,456
3Oct 19, 2022 16:37194,4731,671,000,6961,614,128,68302,203,648