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 listDec 3, 2022 17:29Xavier R. GuérinXavier R. GuérinScore: 114,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2022 17:26114,2401,018,286,422948,194,97502,273,280
2Dec 3, 2022 17:26114,4711,016,680,157950,111,18002,273,280
3Dec 3, 2022 17:29114,4791,012,019,096950,171,87102,273,280
4Dec 3, 2022 17:29114,5161,012,551,722950,484,43402,269,184
5Dec 3, 2022 17:26114,5341,000,122,144950,633,90702,277,376
6Dec 3, 2022 17:29114,5731,018,817,808950,958,02802,265,088