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:51wnwnScore: 3,421Success
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:513,38741,868,13627,060,0001,053,0002,482,176
2May 7, 2026 10:513,39544,820,60327,114,0001,070,0002,490,368
3May 7, 2026 10:513,41544,213,30727,272,0001,073,0002,482,176
4May 7, 2026 10:513,41844,229,22427,236,0001,136,0002,478,080
5May 7, 2026 10:513,42143,793,03327,314,0001,083,0002,490,368
6May 7, 2026 10:513,42644,771,24727,343,0001,094,0002,486,272
7May 7, 2026 10:513,49647,105,26127,936,0001,081,0002,473,984
8May 7, 2026 10:513,53343,957,20728,256,0001,075,0002,482,176
9May 7, 2026 10:513,56146,846,20128,464,0001,096,0002,486,272