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 21:03Kevin HeaveyKevin HeaveyScore: 70,144Success
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 21:1068,616579,862,498566,298,0003,217,0002,121,728
2Jul 21, 2026 21:1068,962582,096,883569,254,0003,137,0002,121,728
3Jul 21, 2026 21:1069,537586,833,118574,044,0003,121,0002,121,728
4Jul 21, 2026 21:1069,595587,375,126574,445,0003,198,0002,121,728
5Jul 21, 2026 21:1070,144591,972,191578,851,0003,351,0002,121,728
6Jul 21, 2026 21:1072,916615,945,413601,946,0003,259,0002,121,728
7Jul 21, 2026 21:1073,793622,176,842609,290,0003,195,0002,121,728
8Jul 21, 2026 21:1074,136625,052,054612,103,0003,226,0002,121,728
9Jul 21, 2026 21:1075,424635,882,415622,653,0003,370,0002,121,728