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 listAug 16, 2026 18:44marko1597marko1597Score: 4,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 18:454,54346,051,34236,690,0001,025,0002,117,632
2Aug 16, 2026 18:454,55646,206,28536,791,0001,031,0002,117,632
3Aug 16, 2026 18:454,56446,162,14736,853,0001,030,0002,117,632
4Aug 16, 2026 18:454,57646,490,47136,943,0001,041,0002,117,632
5Aug 16, 2026 18:454,59646,516,60037,025,0001,123,0002,117,632
6Aug 16, 2026 18:454,60246,553,48137,083,0001,119,0002,117,632
7Aug 16, 2026 18:454,64146,816,53537,424,0001,097,0002,117,632
8Aug 16, 2026 18:454,65246,824,01837,491,0001,124,0002,117,632
9Aug 16, 2026 18:454,66946,966,92237,615,0001,138,0002,117,632