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 listMay 4, 2026 07:03limanjun99limanjun99Score: 5,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 07:045,17159,373,39540,678,0002,247,0002,502,656
2May 4, 2026 07:045,18959,767,38140,814,0002,260,0002,502,656
3May 4, 2026 07:045,20061,190,45840,000,0003,160,0002,498,560
4May 4, 2026 07:045,21461,535,15139,980,0003,303,0002,510,848
5May 4, 2026 07:045,21659,110,00739,988,0003,305,0002,490,368
6May 4, 2026 07:045,26964,253,12341,475,0002,259,0002,502,656
7May 4, 2026 07:045,27363,469,30441,488,0002,278,0002,510,848
8May 4, 2026 07:045,28960,335,12140,656,0003,250,0002,490,368
9May 4, 2026 07:045,30760,745,36241,734,0002,320,0002,519,040