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 16, 2026 17:54KacpxerKacpxerScore: 32,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 17:5432,039276,451,382264,778,0001,149,0002,113,536
2Oct 16, 2026 17:5432,276278,369,657266,833,0001,062,0002,113,536
3Oct 16, 2026 17:5432,966284,098,660272,609,0001,016,0002,113,536