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 14, 2021 19:41Yuriy LyfenkoYuriy LyfenkoScore: 19,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2021 19:4119,921194,163,044165,346,00002,260,992
2May 14, 2021 19:4119,941202,391,041164,511,000997,0002,260,992
3May 14, 2021 19:4119,946194,627,175164,555,000997,0002,260,992
4May 14, 2021 19:4119,948190,047,704164,563,0001,003,0002,486,272
5May 14, 2021 19:4119,953198,329,465165,609,00002,392,064
6May 14, 2021 19:4119,954190,610,303165,620,00002,260,992
7May 14, 2021 19:4120,002191,549,377164,013,0002,000,0002,387,968
8May 14, 2021 19:4120,699199,844,627169,806,0001,997,0002,392,064
9May 14, 2021 19:4120,705201,812,610169,851,0001,998,0002,260,992