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 listJun 27, 2026 02:23Code HintsCode HintsScore: 6,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 02:246,86364,638,09054,925,0002,038,0002,113,536
2Jun 27, 2026 02:246,87764,704,33655,036,0002,048,0002,113,536
3Jun 27, 2026 02:246,96465,474,20655,753,0002,049,0002,113,536
4Jun 27, 2026 02:246,98465,956,17154,920,0003,049,0002,113,536
5Jun 27, 2026 02:246,99265,747,54855,973,0002,063,0002,113,536
6Jun 27, 2026 02:247,01165,841,59456,130,0002,062,0002,113,536
7Jun 27, 2026 02:247,01465,856,54856,192,0002,031,0002,113,536
8Jun 27, 2026 02:247,01965,943,75156,209,0002,054,0002,113,536
9Jun 27, 2026 02:247,05466,221,22255,493,0003,057,0002,113,536