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 29, 2026 11:06wnwnScore: 3,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 11:063,27835,935,52927,212,000020,480
2Sep 29, 2026 11:063,28936,031,97627,301,000020,480
3Sep 29, 2026 11:063,29436,140,98327,344,000020,480
4Sep 29, 2026 11:063,30036,200,89927,398,000020,480
5Sep 29, 2026 11:063,30236,259,36527,412,000020,480
6Sep 29, 2026 11:063,30736,176,29527,451,000020,480
7Sep 29, 2026 11:063,44137,283,97928,565,000020,480
8Sep 29, 2026 11:063,46037,499,72828,718,000020,480
9Sep 29, 2026 11:063,46538,256,30628,760,000020,480