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 19:23Kevin 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 24, 2026 19:243,53939,204,42128,228,0001,148,0002,113,536
2Jul 24, 2026 19:243,55039,255,56028,329,0001,137,0002,113,536
3Jul 24, 2026 19:243,55539,331,44428,388,0001,125,0002,113,536
4Jul 24, 2026 19:243,61539,867,70228,827,0001,179,0002,113,536
5Jul 24, 2026 19:243,67440,347,76029,345,0001,156,0002,113,536
6Jul 24, 2026 19:243,69040,438,70129,462,0001,168,0002,113,536
7Jul 24, 2026 19:243,70240,591,54929,558,0001,175,0002,113,536
8Jul 24, 2026 19:243,80841,450,77130,452,0001,155,0002,113,536
9Jul 24, 2026 19:243,80841,569,61830,458,0001,153,0002,113,536