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 listJun 29, 2021 05:29Yuriy LyfenkoYuriy LyfenkoScore: 76,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 05:2976,898701,117,411638,255,20402,211,840
2Jun 29, 2021 05:2976,901700,508,806638,282,07902,215,936
3Jun 29, 2021 05:4376,901699,393,092638,276,71902,215,936
4Jun 29, 2021 05:4376,901705,692,895638,276,65702,211,840
5Jun 29, 2021 05:4376,903700,891,968638,296,83002,207,744
6Jun 29, 2021 05:2976,907695,705,083638,332,13102,211,840