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 listOct 23, 2022 03:09Kenneth MaplesKenneth MaplesScore: 36,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2022 03:0836,003372,915,205298,824,05602,281,472
2Oct 23, 2022 03:0936,041367,341,889299,141,97402,273,280
3Oct 23, 2022 03:0836,225361,893,591300,671,15802,273,280
4Oct 23, 2022 03:0836,230368,006,721300,706,57602,277,376
5Oct 23, 2022 03:0936,257362,404,546300,932,73802,285,568
6Oct 23, 2022 03:0936,298365,947,169301,272,98102,289,664