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 listDec 13, 2024 04:03barronw0barronw0Score: 403,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2024 04:03402,6983,369,621,3483,277,424,00064,968,0002,281,472
2Dec 13, 2024 04:03403,0073,372,535,8943,274,997,00069,957,0002,281,472
3Dec 13, 2024 04:03403,0873,373,041,6203,281,648,00063,973,0002,281,472
4Dec 13, 2024 04:03403,2093,376,957,3763,279,660,00066,972,0002,367,488
5Dec 13, 2024 04:03403,6193,379,291,9023,272,084,00077,954,0002,281,472
6Dec 13, 2024 04:03403,9053,377,086,5463,286,444,00065,968,0002,285,568
7Dec 13, 2024 04:03404,8403,389,369,5033,304,207,00055,969,0002,285,568
8Dec 13, 2024 04:03405,1733,391,902,6713,285,982,00076,952,0002,281,472
9Dec 13, 2024 04:03405,2883,393,314,4393,299,929,00063,959,0002,490,368