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 18:48KacpxerKacpxerScore: 6,753Success
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 18:486,57365,180,01653,541,0001,019,0002,113,536
2Oct 16, 2026 18:486,57865,144,83753,585,0001,019,0002,113,536
3Oct 16, 2026 18:486,63165,580,28953,009,0002,031,0002,113,536
4Oct 16, 2026 18:486,68266,012,66254,446,0001,018,0002,113,536
5Oct 16, 2026 18:486,75366,544,95455,037,0001,020,0002,113,536
6Oct 16, 2026 18:486,96168,356,05656,762,0001,019,0002,113,536
7Oct 16, 2026 18:487,11469,617,15058,036,0001,017,0002,113,536
8Oct 16, 2026 18:488,00776,971,59465,449,0001,014,0002,113,536
9Oct 16, 2026 18:488,04477,151,66365,755,0001,016,0002,113,536