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 listJun 30, 2026 11:10Victor MerckléVictor MerckléScore: 4,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 11:114,36843,998,92135,152,0001,103,0002,117,632stderr
2Jun 30, 2026 11:114,37344,142,90035,293,0001,009,0002,117,632stderr
3Jun 30, 2026 11:114,37643,995,84135,277,0001,044,0002,117,632stderr
4Jun 30, 2026 11:114,37744,096,09835,301,0001,035,0002,117,632stderr
5Jun 30, 2026 11:114,37944,173,36635,252,0001,096,0002,117,632stderr
6Jun 30, 2026 11:114,39044,140,87335,417,0001,026,0002,117,632stderr
7Jun 30, 2026 11:114,39244,224,82135,420,0001,034,0002,117,632stderr
8Jun 30, 2026 11:114,39445,634,16935,448,0001,027,0002,117,632stderr
9Jun 30, 2026 11:114,42144,482,66335,654,0001,043,0002,117,632stderr