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 listMay 17, 2021 20:16Yuriy LyfenkoYuriy LyfenkoScore: 17,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 20:1617,845375,924,767148,115,00002,396,160
2May 17, 2021 20:1617,8532,564,695,300147,180,0001,001,0002,260,992
3May 17, 2021 20:1617,8601,092,163,188148,238,00002,519,040
4May 17, 2021 20:1617,8622,220,113,645146,262,0001,989,0002,523,136
5May 17, 2021 20:1617,878941,161,002147,382,0001,002,0002,392,064
6May 17, 2021 20:1617,8801,003,840,197148,400,00002,519,040
7May 17, 2021 20:1617,8822,710,173,493148,421,00002,260,992
8May 17, 2021 20:1617,8911,873,738,371146,503,0001,993,0002,400,256
9May 17, 2021 20:1617,8921,860,627,937146,508,0001,993,0002,519,040