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 1, 2021 09:27piculpiculScore: 84,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2021 09:2084,208767,547,720698,922,45702,301,952
2Sep 1, 2021 09:2784,287770,378,786699,582,72902,297,856
3Sep 1, 2021 09:2084,319757,125,887699,846,11002,301,952
4Sep 1, 2021 09:2084,333778,757,914699,966,03302,179,072
5Sep 1, 2021 09:2784,443761,599,483700,878,80402,179,072
6Sep 1, 2021 09:2784,447766,964,370700,910,20602,174,976