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 listMar 11, 2026 15:45caandocaandoScore: 5,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 15:455,32568,718,82843,194,0001,004,0002,486,272
2Mar 11, 2026 15:455,41364,278,88342,934,0001,996,0002,285,568
3Mar 11, 2026 15:455,43074,238,76344,070,0001,001,0002,473,984
4Mar 11, 2026 15:455,53867,676,26243,969,0001,998,0002,482,176
5Mar 11, 2026 15:455,57371,050,97344,248,0002,011,0002,285,568
6Mar 11, 2026 15:455,58265,529,98544,319,0002,014,0002,285,568