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 27, 2026 05:38wnwnScore: 3,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:393,42044,279,72727,378,0001,014,0002,478,080
2Apr 27, 2026 05:393,42546,474,89427,419,0001,015,0002,310,144
3Apr 27, 2026 05:393,43341,908,18627,480,0001,017,0002,482,176
4Apr 27, 2026 05:393,44741,446,21326,645,0001,973,0002,490,368
5Apr 27, 2026 05:393,45545,649,02527,659,0001,024,0002,486,272
6Apr 27, 2026 05:393,45746,086,11027,674,0001,024,0002,486,272
7Apr 27, 2026 05:393,46244,101,61826,760,0001,982,0002,330,624
8Apr 27, 2026 05:393,58543,918,32127,778,0001,984,0002,482,176
9Apr 27, 2026 05:393,62444,804,09328,080,0002,005,0002,486,272