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 17, 2026 13:40Kevin HeaveyKevin HeaveyScore: 3,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 13:583,64540,110,32729,207,0001,047,0002,113,536
2Jul 17, 2026 13:583,65640,219,43429,294,0001,054,0002,113,536
3Jul 17, 2026 13:583,66340,302,19829,349,0001,054,0002,113,536
4Jul 17, 2026 13:583,66540,261,92929,369,0001,054,0002,113,536
5Jul 17, 2026 13:583,66740,313,46629,400,0001,044,0002,113,536
6Jul 17, 2026 13:583,67040,406,77029,419,0001,050,0002,113,536
7Jul 17, 2026 13:583,88542,088,21731,128,0001,121,0002,113,536
8Jul 17, 2026 13:583,96442,730,84531,866,0001,042,0002,113,536
9Jul 17, 2026 13:583,98942,989,35232,073,0001,043,0002,113,536