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:25Kevin HeaveyKevin HeaveyScore: 3,593Success
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:313,55540,345,04228,466,0001,046,0002,113,536
2Jul 24, 2026 21:313,56440,477,77628,408,0001,181,0002,113,536
3Jul 24, 2026 21:313,58640,682,20028,536,0001,229,0002,113,536
4Jul 24, 2026 21:313,58940,778,55128,581,0001,212,0002,113,536
5Jul 24, 2026 21:313,59340,614,97128,774,0001,049,0002,113,536
6Jul 24, 2026 21:313,62040,865,20728,997,0001,049,0002,113,536
7Jul 24, 2026 21:313,75241,962,16529,915,0001,227,0002,113,536
8Jul 24, 2026 21:313,76742,178,12930,033,0001,239,0002,113,536
9Jul 24, 2026 21:313,86943,096,65930,902,0001,217,0002,113,536