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 5, 2024 12:19Yingxin JiangYingxin JiangScore: 536,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2024 12:19530,7304,434,999,0084,338,087,00066,970,0002,285,568
2Dec 5, 2024 12:19531,8404,444,763,9774,346,314,00067,958,0002,277,376
3Dec 5, 2024 12:19533,2294,452,952,3544,356,834,00068,965,0002,285,568
4Dec 5, 2024 12:19535,4604,478,007,6074,368,351,00075,971,0002,285,568
5Dec 5, 2024 12:19536,8134,488,273,9734,383,589,00071,960,0002,289,664
6Dec 5, 2024 12:19536,8174,480,871,8434,378,620,00076,958,0002,285,568
7Dec 5, 2024 12:19538,0064,494,833,2114,395,493,00069,960,0002,363,392
8Dec 5, 2024 12:19538,1734,491,046,3724,395,871,00070,965,0002,289,664
9Dec 5, 2024 12:19541,6094,524,449,5494,424,378,00070,973,0002,277,376