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 listJan 16, 2022 18:57Yuriy LyfenkoYuriy LyfenkoScore: 32,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 18:5732,752332,304,350271,845,26602,224,128
2Jan 16, 2022 18:5732,755338,917,024271,869,09202,207,744
3Jan 16, 2022 18:5732,762323,941,970271,925,99102,220,032