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 26, 2026 15:37wnwnScore: 3,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:373,37843,604,56427,039,0001,001,0002,482,176
2Apr 26, 2026 15:373,39546,797,99727,175,0001,006,0002,478,080
3Apr 26, 2026 15:373,43543,810,51628,514,00002,330,624
4Apr 26, 2026 15:373,44340,419,92727,563,0001,020,0002,494,464
5Apr 26, 2026 15:373,45248,834,90427,634,0001,023,0002,494,464
6Apr 26, 2026 15:373,45443,933,70527,652,0001,024,0002,494,464
7Apr 26, 2026 15:373,50443,279,82727,079,0002,005,0002,482,176
8Apr 26, 2026 15:373,58547,138,70127,773,0001,983,0002,486,272
9Apr 26, 2026 15:373,60548,702,88927,930,0001,995,0002,486,272