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 30, 2026 10:05Adam FolwarcznyAdam FolwarcznyScore: 7,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:067,61371,116,22261,158,0002,030,0002,117,632
2Jun 30, 2026 10:067,62871,675,93861,122,0002,197,0002,117,632
3Jun 30, 2026 10:067,63071,327,64561,284,0002,053,0002,117,632
4Jun 30, 2026 10:067,63471,282,37561,148,0002,217,0002,117,632
5Jun 30, 2026 10:067,69471,891,20461,610,0002,251,0002,117,632
6Jun 30, 2026 10:067,73772,002,32562,015,0002,205,0002,117,632
7Jun 30, 2026 10:067,74172,035,03062,024,0002,234,0002,117,632
8Jun 30, 2026 10:067,88073,306,16163,210,0002,197,0002,117,632
9Jun 30, 2026 10:0613,198117,312,926107,343,0002,203,0002,117,632