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 listFeb 17, 2026 20:08wnwnScore: 7,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 20:087,17586,635,02956,523,0003,028,0002,408,448
2Feb 17, 2026 20:087,20584,908,25056,815,0002,990,0002,502,656
3Feb 17, 2026 20:087,22090,549,34856,932,0002,996,0002,486,272
4Feb 17, 2026 20:087,28481,572,42957,435,0003,022,0002,490,368
5Feb 17, 2026 20:087,33585,467,92859,881,000998,0002,445,312
6Feb 17, 2026 20:087,33788,409,39158,898,0001,996,0002,506,752
7Feb 17, 2026 20:087,37093,505,30258,159,0003,008,0002,269,184
8Feb 17, 2026 20:087,40887,517,31957,454,0004,031,0002,367,488
9Feb 17, 2026 20:087,43989,612,63758,760,0002,987,0002,408,448