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 listApr 22, 2026 06:06wnwnScore: 3,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 06:063,41846,426,13927,362,0001,013,0002,330,624
2Apr 22, 2026 06:063,42246,511,91527,391,0001,014,0002,482,176
3Apr 22, 2026 06:063,44942,665,28327,607,0001,022,0002,486,272
4Apr 22, 2026 06:063,45243,706,03927,633,0001,023,0002,482,176
5Apr 22, 2026 06:063,45947,822,48227,688,0001,025,0002,326,528
6Apr 22, 2026 06:063,46549,403,08126,782,0001,983,0002,494,464
7Apr 22, 2026 06:063,47951,046,61226,889,0001,991,0002,486,272
8Apr 22, 2026 06:063,61447,686,04428,002,0002,000,0002,494,464
9Apr 22, 2026 06:063,65548,661,53229,330,0001,011,0002,482,176