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 15:59Victor MerckléVictor MerckléScore: 3,887Success
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 16:013,86040,233,56830,853,0001,191,0002,113,536
2Aug 28, 2026 16:013,86840,244,13930,989,0001,123,0002,113,536
3Aug 28, 2026 16:013,88040,569,02531,103,0001,101,0002,113,536
4Aug 28, 2026 16:013,88140,363,38631,094,0001,122,0002,113,536
5Aug 28, 2026 16:013,88740,645,82731,138,0001,126,0002,113,536
6Aug 28, 2026 16:013,90140,561,24331,266,0001,117,0002,113,536
7Aug 28, 2026 16:013,90840,598,16931,333,0001,109,0002,113,536
8Aug 28, 2026 16:013,90940,613,66731,347,0001,102,0002,113,536
9Aug 28, 2026 16:013,92140,687,52131,496,0001,052,0002,113,536