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 19, 2024 11:49Javid izadiJavid izadiScore: 388,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 11:49387,3883,243,830,9573,149,357,00065,965,0002,281,472
2Dec 19, 2024 11:49387,6453,247,104,7603,142,489,00074,963,0002,285,568
3Dec 19, 2024 11:49387,6523,241,801,0333,149,542,00067,968,0002,281,472
4Dec 19, 2024 11:49387,8673,244,929,1863,152,328,00066,964,0002,281,472
5Dec 19, 2024 11:49388,1363,252,897,2203,154,556,00066,969,0002,285,568
6Dec 19, 2024 11:49390,3433,270,379,7883,167,898,00071,952,0002,289,664
7Dec 19, 2024 11:49391,4833,272,888,6243,168,355,00080,957,0002,285,568
8Dec 19, 2024 11:49392,0853,279,984,4533,174,348,00079,958,0002,281,472
9Dec 19, 2024 11:49416,2563,485,042,0353,377,972,00076,953,0002,285,568