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 16, 2026 13:16marko1597marko1597Score: 5,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:385,88458,739,10847,667,0001,171,0002,113,536
2Aug 16, 2026 13:385,88658,725,25047,691,0001,167,0002,113,536
3Aug 16, 2026 13:385,88958,718,95247,708,0001,173,0002,113,536
4Aug 16, 2026 13:385,90158,809,95947,801,0001,184,0002,113,536
5Aug 16, 2026 13:385,92359,033,91747,999,0001,165,0002,113,536
6Aug 16, 2026 13:385,94559,195,14148,187,0001,160,0002,113,536
7Aug 16, 2026 13:386,02259,800,23648,810,0001,178,0002,113,536
8Aug 16, 2026 13:386,02859,876,41548,881,0001,157,0002,113,536
9Aug 16, 2026 13:386,07760,250,00549,267,0001,176,0002,113,536