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 30, 2026 20:40Josu San MartinJosu San MartinScore: 4,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:444,27443,985,90034,448,0001,028,0002,113,536
2Aug 30, 2026 20:444,27543,942,04334,448,0001,036,0002,113,536
3Aug 30, 2026 20:444,28343,974,92634,526,0001,031,0002,113,536
4Aug 30, 2026 20:444,28544,439,12434,537,0001,036,0002,113,536
5Aug 30, 2026 20:444,28744,162,61634,546,0001,044,0002,113,536
6Aug 30, 2026 20:444,29044,085,19634,489,0001,122,0002,113,536
7Aug 30, 2026 20:444,29444,062,91134,591,0001,057,0002,113,536
8Aug 30, 2026 20:444,29844,130,34634,628,0001,053,0002,113,536
9Aug 30, 2026 20:444,30744,117,91234,731,0001,024,0002,113,536