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 listAug 20, 2026 18:59C21C21Score: 34,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2026 18:5934,665297,693,692286,570,0001,151,0002,113,536
2Aug 20, 2026 18:5934,670297,935,316286,615,0001,148,0002,113,536
3Aug 20, 2026 18:5934,682298,014,656286,691,0001,177,0002,113,536
4Aug 20, 2026 18:5934,698298,001,433286,997,0001,003,0002,113,536
5Aug 20, 2026 18:5934,714298,890,550286,900,0001,230,0002,113,536
6Aug 20, 2026 18:5934,746299,156,848287,129,0001,268,0002,113,536
7Aug 20, 2026 18:5934,754298,415,451287,307,0001,156,0002,113,536
8Aug 20, 2026 18:5934,767300,075,004287,340,0001,233,0002,113,536
9Aug 20, 2026 18:5936,079309,504,859298,439,0001,020,0002,113,536