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 21, 2026 06:52Kevin HeaveyKevin HeaveyScore: 3,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 06:543,63339,831,38829,099,0001,055,0002,113,536
2Jul 21, 2026 06:543,63639,765,84829,137,0001,048,0002,113,536
3Jul 21, 2026 06:543,64539,933,57329,209,0001,050,0002,113,536
4Jul 21, 2026 06:543,64639,889,42529,215,0001,051,0002,113,536
5Jul 21, 2026 06:543,64739,895,64129,221,0001,051,0002,113,536
6Jul 21, 2026 06:543,65339,945,04429,274,0001,048,0002,113,536
7Jul 21, 2026 06:543,66339,989,56829,346,0001,057,0002,113,536
8Jul 21, 2026 06:543,66640,091,71129,381,0001,051,0002,113,536
9Jul 21, 2026 06:543,66840,591,12229,402,0001,049,0002,113,536