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 30, 2026 19:38Josu San MartinJosu San MartinScore: 4,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:384,53246,130,39036,558,0001,061,0002,113,536
2Aug 30, 2026 19:384,53346,073,37936,568,0001,058,0002,113,536
3Aug 30, 2026 19:384,53646,150,60236,589,0001,067,0002,113,536
4Aug 30, 2026 19:384,54046,150,93436,544,0001,141,0002,113,536
5Aug 30, 2026 19:384,54746,203,69036,618,0001,128,0002,113,536
6Aug 30, 2026 19:384,55546,304,16036,673,0001,140,0002,113,536
7Aug 30, 2026 19:384,56746,392,91036,769,0001,145,0002,113,536
8Aug 30, 2026 19:384,57146,360,24536,825,0001,115,0002,113,536
9Aug 30, 2026 19:384,59046,531,96636,938,0001,160,0002,113,536