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 18:40Josu San MartinJosu San MartinScore: 9,405Success
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 18:409,39786,448,13976,931,0001,071,0002,113,536
2Aug 30, 2026 18:409,40086,465,09476,933,0001,089,0002,113,536
3Aug 30, 2026 18:409,40086,547,87176,933,0001,095,0002,113,536
4Aug 30, 2026 18:409,40486,472,76376,976,0001,080,0002,113,536
5Aug 30, 2026 18:409,40586,489,55376,978,0001,086,0002,113,536
6Aug 30, 2026 18:409,41086,675,84977,099,0001,012,0002,113,536
7Aug 30, 2026 18:409,42586,728,80477,120,0001,110,0002,113,536
8Aug 30, 2026 18:409,42686,683,44177,157,0001,083,0002,113,536
9Aug 30, 2026 18:409,44287,584,17177,214,0001,158,0002,113,536