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 22, 2026 20:43Kevin HeaveyKevin HeaveyScore: 3,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 20:443,60839,691,97428,820,0001,128,0002,113,536
2Jul 22, 2026 20:443,61039,716,42928,812,0001,152,0002,113,536
3Jul 22, 2026 20:443,61339,670,61928,942,0001,046,0002,113,536
4Jul 22, 2026 20:443,62339,834,77828,926,0001,149,0002,113,536
5Jul 22, 2026 20:443,67440,561,89329,321,0001,174,0002,113,536
6Jul 22, 2026 20:443,80541,348,76730,432,0001,154,0002,113,536
7Jul 22, 2026 20:443,81041,591,81330,456,0001,168,0002,113,536
8Jul 22, 2026 20:443,84241,580,05230,757,0001,133,0002,113,536
9Jul 22, 2026 20:443,87841,831,59031,049,0001,143,0002,113,536