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 listMay 18, 2026 22:39poilonpoilonScore: 13,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 22:3913,934125,728,862114,521,0001,132,0002,113,536
2May 18, 2026 22:3913,935125,079,485114,527,0001,137,0002,113,536
3May 18, 2026 22:3913,956126,951,607114,705,0001,137,0002,113,536