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 listJan 17, 2024 15:58AnSaAnSaScore: 87,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2024 15:5787,151781,678,724723,355,57202,297,856
2Jan 17, 2024 15:5787,155784,390,701723,385,87802,183,168
3Jan 17, 2024 15:5787,180779,933,849723,591,32702,187,264
4Jan 17, 2024 15:5787,182785,271,815723,613,71602,183,168
5Jan 17, 2024 15:5887,199795,299,932723,748,83302,187,264
6Jan 17, 2024 15:5787,341789,663,369724,931,85302,191,360
7Jan 17, 2024 15:5887,422777,133,412725,605,67502,191,360
8Jan 17, 2024 15:5887,520785,940,004726,412,48502,310,144
9Jan 17, 2024 15:5787,631787,105,439727,339,29802,191,360