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 listAug 7, 2021 22:33Mikhail ShirokovMikhail ShirokovScore: 46,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2021 10:3446,801458,001,093388,451,38602,269,184
2Aug 12, 2021 10:3446,831451,284,107388,694,06302,265,088
3Aug 7, 2021 22:3346,834458,554,045388,724,18202,265,088
4Aug 7, 2021 22:3346,835443,175,558388,733,65102,260,992
5Aug 7, 2021 22:3346,836465,238,459388,736,38502,248,704
6Aug 12, 2021 10:3446,890456,927,243389,190,64902,260,992