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 listApr 26, 2026 05:31olliecrowolliecrowScore: 6,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:316,25969,394,80550,952,000999,0002,433,024
2Apr 26, 2026 05:316,27671,352,63950,090,0002,003,0002,441,216
3Apr 26, 2026 05:316,33276,702,22547,505,0005,053,0002,523,136
4Apr 26, 2026 05:316,33869,856,07250,588,0002,023,0002,404,352
5Apr 26, 2026 05:316,36470,794,14549,833,0002,990,0002,486,272
6Apr 26, 2026 05:316,38071,701,54449,960,0002,997,0002,433,024
7Apr 26, 2026 05:316,38866,748,93249,025,0004,002,0002,486,272
8Apr 26, 2026 05:316,40075,107,03852,125,0001,002,0002,514,944
9Apr 26, 2026 05:316,75270,118,71554,048,0002,001,0002,473,984