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 listFeb 1, 2025 19:42E SequeiraE SequeiraScore: 86,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 19:4286,510740,778,252647,031,00071,003,0002,326,528
2Feb 1, 2025 19:4286,760748,656,235650,198,00069,913,0002,326,528
3Feb 1, 2025 19:4286,893745,767,168644,192,00077,022,0002,326,528