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 listOct 11, 2025 03:39Marco BarboneMarco BarboneScore: 34,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 03:4432,550293,855,415268,163,0002,001,0002,289,664
2Oct 11, 2025 03:4032,555290,488,455268,205,0002,001,0002,273,280
3Oct 11, 2025 03:4332,576298,664,035269,378,0001,001,0002,277,376
4Oct 11, 2025 03:4332,596300,188,743269,550,000998,0002,289,664
5Oct 11, 2025 03:4434,078305,514,045280,853,0001,998,0002,289,664
6Oct 11, 2025 03:3934,265309,506,050284,400,00002,273,280
7Oct 11, 2025 03:4334,268306,625,323284,428,00002,289,664
8Oct 11, 2025 03:3934,299310,613,721283,684,000998,0002,289,664
9Oct 11, 2025 03:3934,299317,951,332284,682,00002,289,664
10Oct 11, 2025 03:4034,299311,020,469283,687,000998,0002,265,088
11Oct 11, 2025 03:4034,300311,145,086282,694,0001,997,0002,289,664
12Oct 11, 2025 03:4434,300319,751,100282,695,0001,997,0002,277,376