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:33wnwnScore: 3,441Success
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:333,41642,511,39527,346,0001,012,0002,486,272
2Apr 26, 2026 15:333,42742,216,63627,434,0001,016,0002,478,080
3Apr 26, 2026 15:333,43342,124,12828,502,00002,482,176
4Apr 26, 2026 15:333,43841,857,59627,524,0001,019,0002,482,176
5Apr 26, 2026 15:333,44142,976,01827,547,0001,020,0002,482,176
6Apr 26, 2026 15:333,48341,135,95826,923,0001,994,0002,478,080
7Apr 26, 2026 15:333,55744,713,33628,508,0001,018,0002,486,272
8Apr 26, 2026 15:333,56846,823,40928,599,0001,021,0002,330,624
9Apr 26, 2026 15:333,63447,107,23028,159,0002,011,0002,486,272