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 listOct 13, 2026 03:26e1011e1011Score: 2,040,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 03:282,038,23016,928,595,15216,853,277,00064,036,0002,113,536
2Oct 13, 2026 03:282,039,22616,936,339,87716,861,541,00064,037,0002,113,536
3Oct 13, 2026 03:282,039,80316,941,655,90916,865,232,00065,135,0002,113,536
4Oct 13, 2026 03:282,040,07016,945,346,02916,868,547,00064,035,0002,113,536
5Oct 13, 2026 03:282,040,47816,948,020,25016,869,932,00066,038,0002,113,536
6Oct 13, 2026 03:282,041,06816,952,992,25216,873,808,00067,060,0002,113,536
7Oct 13, 2026 03:282,041,20016,953,791,80116,874,912,00067,054,0002,113,536
8Oct 13, 2026 03:282,041,28016,955,627,91816,877,587,00065,037,0002,113,536
9Oct 13, 2026 03:282,044,47016,980,483,92816,905,064,00064,045,0002,113,536