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 1, 2026 20:29leoweleoweScore: 460,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 20:29458,2463,833,814,0483,725,476,00077,968,0002,293,760
2Apr 1, 2026 20:29458,3683,834,239,6853,716,515,00087,941,0002,289,664
3Apr 1, 2026 20:29458,9823,842,278,8363,746,588,00062,959,0002,293,760
4Apr 1, 2026 20:29459,4853,846,710,7133,745,766,00067,959,0002,293,760
5Apr 1, 2026 20:29460,3803,845,649,5883,743,190,00077,962,0002,285,568
6Apr 1, 2026 20:29462,9633,869,451,6953,766,621,00075,972,0002,289,664
7Apr 1, 2026 20:29466,0583,894,003,4903,790,336,00077,945,0002,293,760
8Apr 1, 2026 20:29467,1193,904,817,1213,814,119,00062,968,0002,502,656
9Apr 1, 2026 20:29468,6573,919,046,0673,818,889,00070,960,0002,293,760