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, 2023 14:14Kevin HeaveyKevin HeaveyScore: 47,148Success
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, 2023 14:1447,095455,524,502390,886,15902,236,416
2Sep 8, 2023 14:1447,098466,363,366390,916,71402,228,224
3Sep 8, 2023 14:1447,131468,169,493391,188,00302,224,128
4Sep 8, 2023 14:1547,135454,919,933391,219,08402,220,032
5Sep 8, 2023 14:1447,148448,467,771391,329,74202,232,320
6Sep 8, 2023 14:1547,153463,770,131391,367,10702,220,032
7Sep 8, 2023 14:1447,186450,994,072391,643,18302,224,128
8Sep 8, 2023 14:1447,234461,625,606392,038,70002,232,320
9Sep 8, 2023 14:1547,246457,534,537392,140,05602,215,936