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 listJul 24, 2026 21:24Kevin HeaveyKevin HeaveyScore: 3,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 21:283,54139,599,57928,181,0001,216,0002,113,536
2Jul 24, 2026 21:283,56239,771,86228,347,0001,223,0002,113,536
3Jul 24, 2026 21:283,56339,707,53628,380,0001,197,0002,113,536
4Jul 24, 2026 21:283,58139,901,37528,678,0001,047,0002,113,536
5Jul 24, 2026 21:283,64440,429,25829,199,0001,047,0002,113,536
6Jul 24, 2026 21:283,73541,260,18029,796,0001,212,0002,113,536
7Jul 24, 2026 21:283,80841,714,11930,432,0001,182,0002,113,536
8Jul 24, 2026 21:283,83842,002,47430,631,0001,230,0002,113,536
9Jul 24, 2026 21:283,90242,584,60031,191,0001,203,0002,113,536