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 listApr 26, 2026 15:00wnwnScore: 3,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:003,40641,814,38227,266,0001,009,0002,490,368
2Apr 26, 2026 15:003,41043,876,36227,294,0001,010,0002,482,176
3Apr 26, 2026 15:003,42349,929,05427,400,0001,014,0002,494,464
4Apr 26, 2026 15:003,53346,095,14328,313,0001,011,0002,486,272
5Apr 26, 2026 15:003,58946,802,12327,806,0001,986,0002,486,272
6Apr 26, 2026 15:003,59344,098,12127,838,0001,988,0002,486,272
7Apr 26, 2026 15:003,60447,291,25727,920,0001,994,0002,486,272
8Apr 26, 2026 15:003,61650,589,14328,019,0002,001,0002,482,176
9Apr 26, 2026 15:003,62045,838,94228,043,0002,003,0002,478,080