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 listMar 2, 2026 15:26caandocaandoScore: 7,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:266,89685,438,18756,233,0001,004,0002,523,136
2Mar 2, 2026 15:266,94487,010,00456,628,0001,011,0002,285,568
3Mar 2, 2026 15:266,96684,205,07155,827,0001,993,0002,285,568
4Mar 2, 2026 15:267,03480,406,89556,366,0002,013,0002,285,568
5Mar 2, 2026 15:267,06183,778,60257,600,0001,010,0002,523,136
6Mar 2, 2026 15:267,11479,555,04558,049,0001,000,0002,371,584