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:43Yuriy LyfenkoYuriy LyfenkoScore: 17,498Success
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:4317,486977,838,884144,130,0001,000,0002,265,088
2May 17, 2021 20:4317,489765,495,060143,171,0001,988,0002,519,040
3May 17, 2021 20:4317,4891,301,689,580144,166,000994,0002,265,088
4May 17, 2021 20:4317,497547,538,477143,220,0002,003,0002,265,088
5May 17, 2021 20:4317,4981,296,886,173143,243,0001,989,0002,256,896
6May 17, 2021 20:4317,4991,512,767,376145,244,00002,527,232
7May 17, 2021 20:4317,510391,244,862143,339,0001,990,0002,265,088
8May 17, 2021 20:4317,512778,252,374143,356,0001,991,0002,265,088
9May 17, 2021 20:4317,5131,579,625,342144,352,0001,002,0002,527,232