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:12Yuriy LyfenkoYuriy LyfenkoScore: 19,294Success
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:1219,256580,797,588157,814,0002,010,0002,260,992
2May 17, 2021 20:1219,2771,185,346,621160,001,00002,519,040
3May 17, 2021 20:1219,2802,688,735,044158,021,0002,000,0002,527,232
4May 17, 2021 20:1219,2892,053,025,281160,099,00002,260,992
5May 17, 2021 20:1219,2943,062,899,409158,153,0001,989,0002,523,136
6May 17, 2021 20:1219,3072,340,507,660159,251,0001,001,0002,519,040
7May 17, 2021 20:1219,3731,469,312,610159,796,000998,0002,260,992
8May 17, 2021 20:1219,395237,456,060158,993,0001,987,0002,396,160
9May 17, 2021 20:1219,4242,110,190,193158,236,0002,985,0002,519,040