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 23, 2026 17:09parastromparastromScore: 5,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 17:105,74457,944,75145,492,0002,186,0002,113,536
2Sep 23, 2026 17:105,74457,948,73245,534,0002,148,0002,113,536
3Sep 23, 2026 17:105,79858,572,54845,863,0002,268,0002,113,536
4Sep 23, 2026 17:105,80758,425,97745,944,0002,257,0002,113,536
5Sep 23, 2026 17:105,80858,493,16345,989,0002,221,0002,113,536
6Sep 23, 2026 17:105,81658,597,35245,996,0002,280,0002,113,536
7Sep 23, 2026 17:105,81958,613,46945,834,0002,465,0002,113,536
8Sep 23, 2026 17:105,82558,601,33746,071,0002,284,0002,113,536
9Sep 23, 2026 17:105,83459,407,10646,143,0002,287,0002,113,536