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:42Yuriy LyfenkoYuriy LyfenkoScore: 17,985Success
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:4217,963174,922,339146,088,0003,001,0002,396,160
2May 14, 2021 19:4217,966175,259,728145,118,0004,003,0002,260,992
3May 14, 2021 19:4217,969175,109,065148,144,0001,000,0002,260,992
4May 14, 2021 19:4217,972179,559,621147,168,0002,002,0002,392,064
5May 14, 2021 19:4217,985172,670,933148,274,0001,001,0002,260,992
6May 14, 2021 19:4217,986175,435,761147,277,0002,003,0002,396,160
7May 14, 2021 19:4218,117179,463,922150,375,00002,392,064
8May 14, 2021 19:4218,122175,017,926150,412,00002,260,992
9May 14, 2021 19:4218,141179,536,236150,570,00002,392,064