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 28, 2024 18:16korey-skorey-sScore: 61,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 18:1661,214536,856,938506,077,0002,000,0002,281,472
2Dec 28, 2024 18:1661,224532,084,112508,161,00002,289,664
3Dec 28, 2024 18:1661,226531,307,392508,175,00002,289,664
4Dec 28, 2024 18:1661,232530,761,684507,223,0001,000,0002,281,472
5Dec 28, 2024 18:1661,234532,640,450508,245,00002,367,488
6Dec 28, 2024 18:1661,246532,864,072507,340,0001,000,0002,289,664
7Dec 28, 2024 18:1661,250535,352,290507,375,0001,000,0002,289,664
8Dec 28, 2024 18:1661,256540,582,365508,425,00002,281,472
9Dec 28, 2024 18:1661,262535,103,259508,473,00002,371,584