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 11, 2026 16:31Victor MerckléVictor MerckléScore: 5,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 16:335,74856,268,85046,708,0001,005,0002,117,632stderr
2Aug 11, 2026 16:335,76156,001,37146,740,0001,083,0002,117,632stderr
3Aug 11, 2026 16:335,76556,087,54546,765,0001,088,0002,117,632stderr
4Aug 11, 2026 16:335,76956,081,97046,867,0001,021,0002,117,632stderr
5Aug 11, 2026 16:335,77157,580,68946,858,0001,044,0002,117,632stderr
6Aug 11, 2026 16:335,77956,156,47446,873,0001,098,0002,117,632stderr
7Aug 11, 2026 16:335,78056,134,06246,857,0001,117,0002,117,632stderr
8Aug 11, 2026 16:335,78556,259,11546,918,0001,099,0002,117,632stderr
9Aug 11, 2026 16:335,80456,585,58146,982,0001,196,0002,117,632stderr