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 1, 2026 11:04George SeabridgeGeorge SeabridgeScore: 6,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 11:046,91367,724,86056,296,0001,089,0002,113,536
2Aug 1, 2026 11:046,91567,381,44256,306,0001,089,0002,113,536
3Aug 1, 2026 11:046,92367,454,91556,382,0001,082,0002,113,536
4Aug 1, 2026 11:046,93467,565,56156,470,0001,086,0002,113,536
5Aug 1, 2026 11:046,93467,510,90456,473,0001,087,0002,113,536
6Aug 1, 2026 11:048,19878,109,42266,965,0001,084,0002,113,536
7Aug 1, 2026 11:048,20078,037,82666,971,0001,095,0002,113,536
8Aug 1, 2026 11:048,22178,252,99067,223,0001,012,0002,113,536
9Aug 1, 2026 11:048,25478,481,96167,409,0001,101,0002,113,536