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 10, 2026 18:38Lan Hoang DaoLan Hoang DaoScore: 100,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 18:3899,919839,346,002765,169,00064,164,0002,113,536
2Aug 10, 2026 18:38100,021841,016,335766,056,00064,121,0002,113,536
3Aug 10, 2026 18:38100,022840,488,049765,999,00064,190,0002,113,536
4Aug 10, 2026 18:38100,050840,459,521767,297,00063,118,0002,113,536
5Aug 10, 2026 18:38100,128841,117,455765,965,00065,101,0002,113,536
6Aug 10, 2026 18:38100,194841,841,450767,504,00064,107,0002,113,536
7Aug 10, 2026 18:38100,210841,954,403766,599,00065,149,0002,113,536
8Aug 10, 2026 18:38100,778848,458,096772,285,00064,175,0002,113,536
9Aug 10, 2026 18:38101,011848,445,539773,267,00065,132,0002,113,536