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 19, 2021 19:54Yuriy LyfenkoYuriy LyfenkoScore: 17,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 19:5417,254257,537,448142,209,0001,001,0002,392,064
2May 19, 2021 19:5417,2551,846,250,123143,219,00002,265,088
3May 19, 2021 19:5417,2611,355,431,270143,267,00002,260,992
4May 19, 2021 19:5417,2612,172,623,075141,267,0002,003,0002,265,088
5May 19, 2021 19:5417,263754,923,051142,281,0001,001,0002,527,232
6May 19, 2021 19:5417,2663,143,984,988140,323,0002,985,0002,523,136
7May 19, 2021 19:5417,3582,624,129,856143,076,000993,0002,387,968
8May 19, 2021 19:5417,3701,368,707,962144,172,00002,519,040
9May 19, 2021 19:5417,3722,608,451,825144,188,00002,523,136
10May 19, 2021 19:5418,2433,122,916,421151,413,69902,273,280
11May 19, 2021 19:5418,2442,570,151,083151,428,73702,297,856
12May 19, 2021 19:5418,2541,421,627,655151,504,78402,224,128