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 listMar 24, 2026 16:48Ignas BagdonasIgnas BagdonasScore: 10,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 16:4810,853113,211,35989,079,0001,000,0002,293,760
2Mar 24, 2026 16:4810,853118,964,77588,077,0002,001,0002,293,760
3Mar 24, 2026 16:4810,853108,767,89489,078,0001,000,0002,269,184
4Mar 24, 2026 16:4810,855119,099,78588,094,0002,002,0002,510,848
5Mar 24, 2026 16:4810,858111,605,45688,119,0002,002,0002,293,760
6Mar 24, 2026 16:4810,860111,072,44888,135,0002,003,0002,293,760
7Mar 24, 2026 16:4810,860117,524,66888,137,0002,003,0002,265,088
8Mar 24, 2026 16:4810,861117,924,20488,146,0002,003,0002,269,184
9Mar 24, 2026 16:4810,865111,922,64489,180,0001,002,0002,289,664