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 11:39Victor MerckléVictor MerckléScore: 4,404Success
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 11:404,38644,895,03335,239,0001,167,0002,117,632stderr
2Aug 11, 2026 11:404,38744,880,87735,297,0001,119,0002,117,632stderr
3Aug 11, 2026 11:404,39244,905,07135,358,0001,096,0002,117,632stderr
4Aug 11, 2026 11:404,40246,268,73635,453,0001,091,0002,117,632stderr
5Aug 11, 2026 11:404,40444,969,98035,404,0001,153,0002,117,632stderr
6Aug 11, 2026 11:404,41345,007,42135,523,0001,106,0002,117,632stderr
7Aug 11, 2026 11:404,41745,047,15735,572,0001,094,0002,117,632stderr
8Aug 11, 2026 11:404,41845,040,37035,541,0001,134,0002,117,632stderr
9Aug 11, 2026 11:404,43945,290,22035,672,0001,177,0002,117,632stderr