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 listJul 7, 2023 03:23Giga BowserGiga BowserScore: 1,003,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2023 03:231,003,2418,400,819,5988,326,900,63602,256,896
2Jul 7, 2023 03:231,003,3938,394,499,9248,328,159,23302,252,800
3Jul 7, 2023 03:231,004,4218,415,400,3378,336,691,66902,256,896