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 listOct 12, 2024 03:14BradleyBradleyScore: 413,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2024 03:14412,8213,456,239,0413,345,453,00080,962,0002,293,760
2Oct 12, 2024 03:14413,1903,450,872,9683,364,508,00064,971,0002,285,568
3Oct 12, 2024 03:14413,5893,459,176,2873,358,818,00073,973,0002,367,488
4Oct 12, 2024 03:14413,7763,462,250,8153,367,377,00066,967,0002,285,568
5Oct 12, 2024 03:14413,7803,463,406,7453,374,399,00059,971,0002,285,568
6Oct 12, 2024 03:14414,2293,465,638,6113,369,137,00068,961,0002,371,584
7Oct 12, 2024 03:14414,4813,464,945,0753,381,224,00058,969,0002,285,568
8Oct 12, 2024 03:14414,5523,469,737,1753,382,805,00057,979,0002,379,776
9Oct 12, 2024 03:14414,5623,471,332,8653,373,884,00066,977,0002,285,568