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 listSep 19, 2024 01:01DanusanDanusanScore: 1,825,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2024 01:011,821,78615,150,963,17615,059,856,00060,971,0002,289,664
2Sep 19, 2024 01:011,822,35215,158,739,84415,059,547,00065,976,0002,289,664
3Sep 19, 2024 01:011,823,37815,166,250,81915,059,074,00074,965,0002,289,664
4Sep 19, 2024 01:011,824,18915,178,379,71915,077,802,00062,969,0002,273,280
5Sep 19, 2024 01:011,825,56315,180,655,31515,075,207,00076,970,0002,289,664
6Sep 19, 2024 01:011,828,39915,207,239,42315,113,740,00061,974,0002,289,664
7Sep 19, 2024 01:011,828,94815,214,698,22215,115,300,00064,966,0002,281,472
8Sep 19, 2024 01:011,873,72515,581,873,94315,499,942,00051,976,0002,281,472
9Sep 19, 2024 01:012,042,85116,993,287,86916,901,687,00053,976,0002,293,760