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 7, 2026 15:12TonyTonyScore: 6,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 15:136,61564,773,37152,360,0002,552,0002,113,536
2Aug 7, 2026 15:136,62265,983,78452,416,0002,552,0002,113,536
3Aug 7, 2026 15:136,62664,837,74652,439,0002,562,0002,113,536
4Aug 7, 2026 15:136,64265,019,85252,555,0002,581,0002,113,536
5Aug 7, 2026 15:136,64364,977,29952,621,0002,524,0002,113,536
6Aug 7, 2026 15:136,66365,100,85452,762,0002,542,0002,113,536
7Aug 7, 2026 15:136,66665,149,33752,749,0002,582,0002,113,536
8Aug 7, 2026 15:136,69665,403,52453,549,0002,032,0002,113,536
9Aug 7, 2026 15:136,71865,630,59453,192,0002,570,0002,113,536