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 3, 2026 17:37Teow Hua JunTeow Hua JunScore: 8,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 17:378,79682,750,46071,736,0001,274,0002,113,536
2Aug 3, 2026 17:378,79882,796,36071,752,0001,278,0002,113,536
3Aug 3, 2026 17:378,79982,827,90171,771,0001,265,0002,113,536
4Aug 3, 2026 17:378,79982,837,03971,832,0001,200,0002,113,536
5Aug 3, 2026 17:378,80582,918,69072,075,0001,008,0002,113,536
6Aug 3, 2026 17:378,80683,024,43771,827,0001,266,0002,113,536
7Aug 3, 2026 17:378,80982,936,32272,114,0001,008,0002,113,536
8Aug 3, 2026 17:378,81083,026,93472,105,0001,020,0002,113,536
9Aug 3, 2026 17:378,81782,994,52172,099,0001,089,0002,113,536