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 12, 2026 12:22Victor MerckléVictor MerckléScore: 3,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 12:223,76039,609,89230,119,0001,089,0002,117,632stderr
2Aug 12, 2026 12:223,78239,825,54630,301,0001,096,0002,117,632stderr
3Aug 12, 2026 12:223,79440,624,18330,295,0001,196,0002,117,632stderr
4Aug 12, 2026 12:223,79639,903,92130,419,0001,096,0002,117,632stderr
5Aug 12, 2026 12:223,80739,941,89830,519,0001,085,0002,117,632stderr
6Aug 12, 2026 12:223,82140,120,36230,601,0001,116,0002,117,632stderr
7Aug 12, 2026 12:223,82240,123,69630,595,0001,131,0002,117,632stderr
8Aug 12, 2026 12:223,86040,483,28930,912,0001,126,0002,117,632stderr
9Aug 12, 2026 12:223,93841,145,96931,611,0001,077,0002,117,632stderr