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 22:52Kevin HeaveyKevin HeaveyScore: 3,588Success
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 23:023,57239,536,02228,603,0001,052,0002,113,536
2Jul 21, 2026 23:023,57539,513,38528,631,0001,045,0002,113,536
3Jul 21, 2026 23:023,58039,618,99228,670,0001,047,0002,113,536
4Jul 21, 2026 23:023,58339,633,71128,696,0001,048,0002,117,632
5Jul 21, 2026 23:023,58843,305,76728,534,0001,249,0002,113,536
6Jul 21, 2026 23:023,59539,690,17528,591,0001,250,0002,113,536
7Jul 21, 2026 23:023,84645,769,39330,884,0001,043,0002,113,536
8Jul 21, 2026 23:023,87145,327,26831,102,0001,030,0002,113,536
9Jul 21, 2026 23:023,90043,244,39531,326,0001,044,0002,113,536