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 27, 2026 02:32wnwnScore: 3,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 02:323,37543,632,70926,019,0002,001,0002,490,368
2Apr 27, 2026 02:323,38245,263,31126,071,0002,005,0002,330,624
3Apr 27, 2026 02:323,43349,080,20727,479,0001,017,0002,482,176
4Apr 27, 2026 02:323,45747,480,44126,719,0001,979,0002,482,176
5Apr 27, 2026 02:323,46146,050,20026,749,0001,981,0002,486,272
6Apr 27, 2026 02:323,46942,680,55226,811,0001,986,0002,486,272
7Apr 27, 2026 02:323,48344,818,69426,920,0001,994,0002,486,272
8Apr 27, 2026 02:323,53249,156,48728,306,0001,010,0002,478,080
9Apr 27, 2026 02:323,55848,342,72728,520,0001,018,0002,482,176