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 16, 2021 18:35Yuriy LyfenkoYuriy LyfenkoScore: 17,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2021 18:3517,8603,201,520,971148,238,00002,260,992
2May 16, 2021 18:3517,8615,039,412,612148,250,00002,265,088
3May 16, 2021 18:3517,866715,428,045146,283,0002,003,0002,265,088
4May 16, 2021 18:3517,8694,076,485,671146,319,0001,990,0002,519,040
5May 16, 2021 18:3517,8774,611,202,483147,378,0001,002,0002,256,896
6May 16, 2021 18:3518,0083,924,963,476148,470,000996,0002,523,136
7May 16, 2021 18:3518,0134,269,223,696148,515,000996,0002,523,136
8May 16, 2021 18:3518,014548,977,938146,529,0002,990,0002,260,992
9May 16, 2021 18:3518,0361,879,672,477146,724,0002,974,0002,260,992