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 20, 2024 16:12Dibash ThapaDibash ThapaScore: 353,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2024 16:12352,3112,952,129,3372,853,203,00070,980,0002,371,584
2Sep 20, 2024 16:12352,3562,952,424,7672,859,588,00064,967,0002,289,664
3Sep 20, 2024 16:12352,6822,950,692,3532,850,303,00076,954,0002,281,472
4Sep 20, 2024 16:12353,1042,960,320,4842,854,796,00075,967,0002,289,664
5Sep 20, 2024 16:12353,1322,957,399,2072,870,017,00060,979,0002,367,488
6Sep 20, 2024 16:12353,5062,965,666,1112,871,116,00062,980,0002,281,472
7Sep 20, 2024 16:12355,4782,978,649,3612,884,501,00065,965,0002,367,488
8Sep 20, 2024 16:12355,5062,973,326,4622,893,727,00056,974,0002,375,680
9Sep 20, 2024 16:12358,4993,009,564,9062,906,579,00068,966,0002,371,584