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 listJul 5, 2026 13:29Teow Hua JunTeow Hua JunScore: 20,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:3220,490179,559,478109,393,00060,679,0002,113,536
2Jul 5, 2026 13:3220,512179,670,424109,356,00060,897,0002,113,536
3Jul 5, 2026 13:3220,587180,316,396109,765,00061,108,0002,113,536
4Jul 5, 2026 13:3220,608180,540,254109,457,00061,593,0002,113,536
5Jul 5, 2026 13:3220,640180,708,909109,470,00061,850,0002,113,536
6Jul 5, 2026 13:3220,650181,292,839109,289,00062,107,0002,113,536
7Jul 5, 2026 13:3220,670181,050,444109,378,00062,183,0002,113,536
8Jul 5, 2026 13:3220,672181,001,261109,653,00061,926,0002,113,536
9Jul 5, 2026 13:3220,686181,122,912109,766,00061,934,0002,113,536