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 listMay 5, 2026 14:51flavio87flavio87Score: 27,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:5227,486242,609,295226,954,0001,182,0002,547,712
2May 5, 2026 14:5227,491246,675,929226,980,0001,201,0002,527,232
3May 5, 2026 14:5227,492246,786,433226,986,0001,203,0002,527,232
4May 5, 2026 14:5227,494243,266,151227,199,0001,008,0002,531,328
5May 5, 2026 14:5227,495244,903,856227,031,0001,183,0002,539,520
6May 5, 2026 14:5227,495245,647,103227,019,0001,193,0002,519,040
7May 5, 2026 14:5227,501245,321,424226,986,0001,278,0002,535,424
8May 5, 2026 14:5227,504244,047,841227,278,0001,008,0002,519,040
9May 5, 2026 14:5228,306251,549,904233,941,0001,006,0002,519,040