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 18, 2026 16:11wnwnScore: 4,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 15:584,44957,608,14134,934,0001,996,0002,494,464
2Apr 18, 2026 16:114,46358,700,97735,038,0002,002,0002,277,376
3Apr 18, 2026 16:114,46657,833,58335,067,0002,003,0002,277,376
4Apr 18, 2026 16:114,47262,429,82335,111,0002,006,0002,277,376
5Apr 18, 2026 15:584,48365,028,31336,206,0001,005,0002,494,464
6Apr 18, 2026 15:584,51761,161,86136,477,0001,013,0002,277,376
7Apr 18, 2026 15:584,58256,385,85636,033,0002,001,0002,277,376
8Apr 18, 2026 15:584,72465,301,33437,198,0002,010,0002,277,376
9Apr 18, 2026 16:114,80164,752,26338,852,000996,0002,277,376
10Apr 18, 2026 15:584,81069,721,63937,930,0001,996,0002,277,376
11Apr 18, 2026 16:114,82461,503,62338,038,0002,002,0002,277,376
12Apr 18, 2026 16:114,84061,979,53738,164,0002,008,0002,494,464