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 10:31wnwnScore: 3,510Success
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 10:313,40943,440,48127,220,0001,075,0002,482,176
2May 7, 2026 10:313,41843,209,12127,312,0001,063,0002,482,176
3May 7, 2026 10:313,44244,160,01327,478,0001,094,0002,486,272
4May 7, 2026 10:313,49443,785,83727,909,0001,092,0002,494,464
5May 7, 2026 10:313,51045,551,34128,054,0001,080,0002,482,176
6May 7, 2026 10:313,51845,297,42928,112,0001,094,0002,490,368
7May 7, 2026 10:313,57844,804,45628,613,0001,090,0002,482,176
8May 7, 2026 10:313,59443,773,03128,764,0001,073,0002,486,272
9May 7, 2026 10:313,61844,349,17128,931,0001,101,0002,482,176