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 13, 2026 06:37e1011e1011Score: 57,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:3857,619488,847,914423,632,00054,609,0002,113,536
2Oct 13, 2026 06:3857,649489,343,080424,020,00054,470,0002,113,536
3Oct 13, 2026 06:3857,670489,860,349424,097,00054,565,0002,113,536
4Oct 13, 2026 06:3857,704490,225,497424,396,00054,549,0002,113,536
5Oct 13, 2026 06:3857,707490,243,621424,531,00054,444,0002,113,536
6Oct 13, 2026 06:3857,788490,235,999424,223,00055,418,0002,113,536
7Oct 13, 2026 06:3857,795490,924,714425,144,00054,555,0002,113,536
8Oct 13, 2026 06:3857,805491,172,326424,235,00055,553,0002,113,536
9Oct 13, 2026 06:3857,836491,225,054424,610,00055,434,0002,113,536