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 listOct 6, 2025 10:13TakopiTakopiScore: 2,066,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2025 10:132,064,49917,178,155,00617,066,381,00068,961,0002,519,040
2Oct 6, 2025 10:132,064,68017,168,138,64017,081,873,00054,973,0002,277,376
3Oct 6, 2025 10:132,065,38017,175,296,69417,079,687,00062,969,0002,285,568
4Oct 6, 2025 10:132,065,46417,175,959,19417,080,380,00062,968,0002,269,184
5Oct 6, 2025 10:132,066,45317,189,060,11017,080,592,00070,965,0002,277,376
6Oct 6, 2025 10:132,066,65017,190,071,09717,093,222,00059,969,0002,285,568
7Oct 6, 2025 10:132,066,91417,187,280,87017,081,428,00073,962,0002,285,568
8Oct 6, 2025 10:132,067,76917,196,699,48117,092,523,00069,961,0002,265,088
9Oct 6, 2025 10:132,068,54317,202,584,78717,109,939,00058,968,0002,289,664