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 listMay 7, 2026 09:57wnwnScore: 3,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 09:573,39543,202,21727,104,0001,080,0002,494,464
2May 7, 2026 09:573,39543,255,52927,118,0001,064,0002,486,272
3May 7, 2026 09:573,39646,793,10727,123,0001,069,0002,490,368
4May 7, 2026 09:573,40044,821,88427,153,0001,073,0002,486,272
5May 7, 2026 09:573,41043,392,48927,224,0001,083,0002,482,176
6May 7, 2026 09:573,54545,353,57428,356,0001,074,0002,494,464
7May 7, 2026 09:573,56346,649,93428,483,0001,092,0002,482,176
8May 7, 2026 09:573,58447,995,69628,661,0001,093,0002,486,272
9May 7, 2026 09:573,59546,452,14528,733,0001,113,0002,482,176