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 listJul 17, 2026 04:13Kevin HeaveyKevin HeaveyScore: 3,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 04:183,76341,067,61230,191,0001,049,0002,113,536
2Jul 17, 2026 04:183,79141,347,10830,421,0001,046,0002,113,536
3Jul 17, 2026 04:183,79841,286,42730,480,0001,047,0002,113,536
4Jul 17, 2026 04:183,80441,399,34530,532,0001,047,0002,113,536
5Jul 17, 2026 04:183,84642,858,19530,790,0001,134,0002,113,536
6Jul 17, 2026 04:183,88542,072,18431,200,0001,046,0002,113,536
7Jul 17, 2026 04:184,00145,424,54832,169,0001,045,0002,113,536
8Jul 17, 2026 04:184,05643,632,55032,629,0001,042,0002,113,536
9Jul 17, 2026 04:184,07243,720,28332,762,0001,043,0002,113,536