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 listSep 24, 2026 06:11wnwnScore: 4,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:154,46645,768,15227,234,0009,842,00020,480
2Sep 24, 2026 06:154,51346,400,91427,528,0009,936,00020,480
3Sep 24, 2026 06:154,56346,659,50327,243,00010,637,00020,480
4Sep 24, 2026 06:154,58146,773,84827,406,00010,622,00020,480
5Sep 24, 2026 06:154,60447,006,06428,353,0009,868,00020,480
6Sep 24, 2026 06:154,66747,490,67728,345,00010,394,00020,480
7Sep 24, 2026 06:154,69547,733,13527,391,00011,578,0002,113,536
8Sep 24, 2026 06:154,86149,738,69429,394,00010,958,0002,113,536
9Sep 24, 2026 06:154,89349,989,35328,992,00011,628,0002,113,536