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 2, 2026 17:21George SeabridgeGeorge SeabridgeScore: 8,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:218,11778,019,39765,112,0002,262,0002,113,536
2Aug 2, 2026 17:218,12377,370,16665,174,0002,249,0002,113,536
3Aug 2, 2026 17:218,12678,089,44965,204,0002,246,0002,113,536
4Aug 2, 2026 17:218,31479,625,81066,798,0002,213,0002,113,536
5Aug 2, 2026 17:218,33079,089,79466,954,0002,189,0002,113,536
6Aug 2, 2026 17:218,35380,029,06667,130,0002,203,0002,113,536
7Aug 2, 2026 17:218,35780,138,32967,172,0002,196,0002,113,536
8Aug 2, 2026 17:218,37480,246,26867,245,0002,264,0002,113,536
9Aug 2, 2026 17:219,56490,021,36177,145,0002,240,0002,113,536