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 28, 2026 05:14Victor MerckléVictor MerckléScore: 5,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:185,76657,590,41546,716,0001,149,0002,113,536
2Aug 28, 2026 05:185,78656,452,75846,896,0001,130,0002,113,536
3Aug 28, 2026 05:185,79356,520,33046,947,0001,140,0002,113,536
4Aug 28, 2026 05:185,80756,612,95947,018,0001,183,0002,113,536
5Aug 28, 2026 05:185,83457,529,10047,304,0001,126,0002,113,536
6Aug 28, 2026 05:185,83956,871,48147,344,0001,126,0002,113,536
7Aug 28, 2026 05:186,02158,352,07148,862,0001,119,0002,113,536
8Aug 28, 2026 05:186,02358,391,54148,885,0001,114,0002,113,536
9Aug 28, 2026 05:186,08658,887,51549,405,0001,112,0002,113,536