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 listMar 18, 2026 00:17Elijah KinElijah KinScore: 65,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 00:1765,677567,309,291488,107,00057,012,0002,330,624
2Mar 18, 2026 00:1765,689568,398,577483,196,00062,025,0002,482,176
3Mar 18, 2026 00:1765,695569,908,163492,245,00053,026,0002,473,984
4Mar 18, 2026 00:1765,698572,884,433483,259,00062,033,0002,285,568
5Mar 18, 2026 00:1765,710568,902,641487,461,00057,935,0002,277,376
6Mar 18, 2026 00:1765,730573,440,502496,602,00048,960,0002,285,568
7Mar 18, 2026 00:1765,739579,484,020492,671,00052,964,0002,285,568
8Mar 18, 2026 00:1765,745572,517,140500,712,00044,974,0002,285,568
9Mar 18, 2026 00:1765,824569,930,095491,303,00055,034,0002,478,080