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 14:34Teow Hua JunTeow Hua JunScore: 10,998Success
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 14:3410,986100,987,29190,118,0001,066,0002,113,536
2Aug 3, 2026 14:3410,993101,027,34890,164,0001,086,0002,113,536
3Aug 3, 2026 14:3410,995101,757,13890,166,0001,093,0002,113,536
4Aug 3, 2026 14:3410,997101,103,67390,204,0001,072,0002,113,536
5Aug 3, 2026 14:3410,998101,119,38590,205,0001,085,0002,113,536
6Aug 3, 2026 14:3410,998101,069,82290,210,0001,080,0002,113,536
7Aug 3, 2026 14:3411,003101,192,64990,255,0001,078,0002,113,536
8Aug 3, 2026 14:3411,004101,181,73190,230,0001,107,0002,113,536
9Aug 3, 2026 14:3411,041101,418,91990,563,0001,081,0002,113,536