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,491Success
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,4671,419,994,159143,986,000993,0002,260,992
2May 17, 2021 20:4317,4752,169,467,568144,041,0001,000,0002,523,136
3May 17, 2021 20:4317,4781,830,071,639145,067,00002,265,088
4May 17, 2021 20:4317,488636,339,746143,166,0001,988,0002,256,896
5May 17, 2021 20:4317,491226,694,714143,185,0001,988,0002,527,232
6May 17, 2021 20:4317,492353,419,815144,183,0001,001,0002,260,992
7May 17, 2021 20:4317,4951,261,254,836145,210,00002,256,896
8May 17, 2021 20:4317,4961,040,465,323142,230,0002,983,0002,260,992
9May 17, 2021 20:4317,4993,119,513,328144,248,000994,0002,527,232