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 listMay 30, 2024 04:08GraceGraceScore: 6,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2024 04:096,472137,391,14553,717,70702,191,360
2May 30, 2024 04:096,500114,945,31053,947,18002,183,168
3May 30, 2024 04:086,503116,789,65353,977,83802,183,168
4May 30, 2024 04:086,509124,400,39554,023,22402,179,072
5May 30, 2024 04:096,549116,480,89854,359,93502,195,456
6May 30, 2024 04:086,565133,595,95954,493,26502,187,264
7May 30, 2024 04:096,572111,473,11954,550,45702,195,456
8May 30, 2024 04:096,582112,901,75454,627,09202,187,264
9May 30, 2024 04:096,663124,360,92355,301,06902,187,264
10May 30, 2024 04:096,671133,781,38755,370,49802,179,072
11May 30, 2024 04:096,718114,263,87455,762,59802,187,264
12May 30, 2024 04:096,730118,886,09155,861,15102,191,360