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 12, 2026 13:35Kevin HeaveyKevin HeaveyScore: 4,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 13:374,41846,282,43635,499,0001,177,0002,117,632
2Jul 12, 2026 13:374,41846,369,28335,663,0001,014,0002,117,632
3Jul 12, 2026 13:374,42146,356,31935,489,0001,211,0002,117,632
4Jul 12, 2026 13:374,42246,358,46935,520,0001,185,0002,117,632
5Jul 12, 2026 13:374,42246,254,71735,513,0001,190,0002,117,632
6Jul 12, 2026 13:374,43046,460,65935,750,0001,021,0002,117,632
7Jul 12, 2026 13:374,43346,459,08735,768,0001,026,0002,117,632
8Jul 12, 2026 13:374,43646,515,03335,628,0001,195,0002,117,632
9Jul 12, 2026 13:374,50247,051,37936,356,0001,016,0002,117,632