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 listAug 2, 2026 18:45TonyTonyScore: 14,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 18:4513,962125,945,95693,006,00022,885,0002,113,536
2Aug 2, 2026 18:4513,963126,000,21692,769,00023,125,0002,113,536
3Aug 2, 2026 18:4513,993126,191,74093,298,00022,845,0002,113,536
4Aug 2, 2026 18:4514,008127,123,00993,198,00023,073,0002,113,536
5Aug 2, 2026 18:4514,042126,670,50693,338,00023,213,0002,113,536
6Aug 2, 2026 18:4514,132127,403,05394,144,00023,156,0002,113,536
7Aug 2, 2026 18:4514,147127,732,38394,302,00023,119,0002,113,536
8Aug 2, 2026 18:4516,150144,100,202110,771,00023,277,0002,113,536
9Aug 2, 2026 18:4516,206145,285,848111,328,00023,186,0002,113,536