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 listSep 6, 2026 10:02Kevin HeaveyKevin HeaveyScore: 3,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:033,55439,547,09528,333,0001,167,0002,113,536
2Sep 6, 2026 10:033,59739,951,35528,675,0001,187,0002,113,536
3Sep 6, 2026 10:033,65340,424,84629,162,0001,158,0002,113,536
4Sep 6, 2026 10:033,67541,853,96929,364,0001,146,0002,113,536
5Sep 6, 2026 10:033,76641,269,10730,126,0001,138,0002,113,536
6Sep 6, 2026 10:033,80941,678,21030,430,0001,192,0002,113,536
7Sep 6, 2026 10:033,86442,062,89230,920,0001,156,0002,113,536
8Sep 6, 2026 10:033,88442,378,79031,073,0001,172,0002,113,536
9Sep 6, 2026 10:033,92942,689,27331,573,0001,045,0002,113,536