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 listJun 25, 2026 20:57Victor MerckléVictor MerckléScore: 5,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 20:575,58354,197,90645,273,0001,074,0002,113,536
2Jun 25, 2026 20:575,59054,130,68645,309,0001,093,0002,113,536
3Jun 25, 2026 20:575,61454,412,18445,528,0001,072,0002,113,536
4Jun 25, 2026 20:575,62154,139,22845,621,0001,035,0002,113,536
5Jun 25, 2026 20:575,64654,409,23845,841,0001,022,0002,113,536
6Jun 25, 2026 20:575,66954,560,51845,937,0001,121,0002,113,536
7Jun 25, 2026 20:575,70354,912,94146,254,0001,084,0002,113,536
8Jun 25, 2026 20:575,73355,111,91646,467,0001,118,0002,113,536
9Jun 25, 2026 20:575,76455,257,71046,743,0001,102,0002,113,536