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 listFeb 9, 2026 18:26nunnunScore: 154,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 18:26153,9971,301,656,5811,039,329,000238,845,0002,310,144
2Feb 9, 2026 18:26154,2081,310,193,9031,038,130,000241,797,0002,306,048
3Feb 9, 2026 18:26154,3311,304,949,9631,037,150,000243,800,0002,297,856
4Feb 9, 2026 18:26154,4741,302,501,6801,037,299,000244,834,0002,289,664
5Feb 9, 2026 18:26154,5511,309,852,2991,043,005,000239,771,0002,363,392
6Feb 9, 2026 18:26155,9031,321,449,9521,051,182,000242,811,0002,465,792
7Feb 9, 2026 18:26156,2731,326,513,0171,039,250,000257,813,0002,301,952
8Feb 9, 2026 18:26156,3171,327,856,3801,048,542,000248,891,0002,404,352
9Feb 9, 2026 18:26156,9971,330,540,3491,053,254,000249,823,0002,314,240