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 22, 2021 15:42Yuriy LyfenkoYuriy LyfenkoScore: 17,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 15:4217,202165,840,878142,775,00002,260,992
2May 22, 2021 15:4217,210175,512,240140,842,0001,997,0002,260,992
3May 22, 2021 15:4217,216168,220,674141,891,000999,0002,260,992
4May 22, 2021 15:4217,228167,971,738141,997,000999,0002,506,752
5May 22, 2021 15:4217,228172,841,186141,992,000999,0002,392,064
6May 22, 2021 15:4217,229165,878,514143,001,00002,510,848
7May 22, 2021 15:4217,242170,467,955142,114,000993,0002,260,992
8May 22, 2021 15:4217,255173,606,934142,217,0001,001,0002,260,992
9May 22, 2021 15:4217,267169,273,559142,310,0001,002,0002,396,160
10May 22, 2021 15:4217,872211,611,187148,335,34702,265,088
11May 22, 2021 15:4217,881204,031,581148,409,78202,269,184
12May 22, 2021 15:4217,884202,904,739148,439,82602,277,376