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 14, 2024 15:58Joad NacerJoad NacerScore: 4,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 15:584,39554,630,76433,441,0003,040,0002,535,424
2Oct 14, 2024 15:584,42062,275,67335,668,0001,019,0002,273,280
3Oct 14, 2024 15:584,43864,148,79533,852,0002,986,0002,535,424
4Oct 14, 2024 15:584,44059,475,68234,857,0001,991,0002,306,048
5Oct 14, 2024 15:584,46462,207,32735,046,0002,002,0002,535,424
6Oct 14, 2024 15:584,46957,963,22135,085,0002,004,0002,297,856
7Oct 14, 2024 15:584,47259,372,81434,112,0003,009,0002,297,856
8Oct 14, 2024 15:584,47661,996,44836,148,0001,004,0002,301,952
9Oct 14, 2024 15:584,48367,753,27336,203,0001,005,0002,301,952
10Oct 14, 2024 15:584,48662,057,98936,226,0001,006,0002,285,568
11Oct 14, 2024 15:584,53063,339,86736,587,0001,016,0002,387,968
12Oct 14, 2024 15:584,55763,413,88635,836,0001,990,0002,531,328