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 12:12marko1597marko1597Score: 5,541Success
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 12:275,30153,976,99842,848,0001,154,0002,113,536
2Aug 16, 2026 12:275,30954,048,35042,921,0001,151,0002,113,536
3Aug 16, 2026 12:275,42855,087,02643,885,0001,169,0002,113,536
4Aug 16, 2026 12:275,43056,202,89043,913,0001,161,0002,113,536
5Aug 16, 2026 12:275,54156,010,04644,857,0001,138,0002,113,536
6Aug 16, 2026 12:275,55756,172,03244,968,0001,156,0002,113,536
7Aug 16, 2026 12:275,57156,956,31745,095,0001,145,0002,113,536
8Aug 16, 2026 12:275,57356,559,72445,215,0001,046,0002,113,536
9Aug 16, 2026 12:275,57856,327,98145,168,0001,137,0002,113,536