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 12, 2026 05:36Victor MerckléVictor MerckléScore: 3,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 05:373,78539,901,73730,292,0001,127,0002,117,632stderr
2Aug 12, 2026 05:373,81340,061,89230,571,0001,079,0002,117,632stderr
3Aug 12, 2026 05:373,81440,138,24430,420,0001,238,0002,117,632stderr
4Aug 12, 2026 05:373,82040,245,42630,569,0001,140,0002,117,632stderr
5Aug 12, 2026 05:373,82340,132,26230,648,0001,085,0002,117,632stderr
6Aug 12, 2026 05:373,83240,242,85630,718,0001,092,0002,117,632stderr
7Aug 12, 2026 05:373,84540,326,36230,833,0001,082,0002,117,632stderr
8Aug 12, 2026 05:373,85140,368,09030,876,0001,094,0002,117,632stderr
9Aug 12, 2026 05:374,11242,514,74833,048,0001,087,0002,117,632stderr