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 listNov 10, 2023 09:21matsuoka-601matsuoka-601Score: 12,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2023 09:2112,305128,342,702100,129,0002,002,0002,285,568
2Nov 10, 2023 09:2112,316128,275,733100,215,0002,004,0002,285,568
3Nov 10, 2023 09:2112,317129,913,394100,225,0002,004,0002,285,568
4Nov 10, 2023 09:2112,320128,149,693100,251,0002,005,0002,285,568
5Nov 10, 2023 09:2112,323125,318,533100,278,0002,005,0002,277,376
6Nov 10, 2023 09:2112,325128,556,865100,294,0002,005,0002,289,664
7Nov 10, 2023 09:2112,326124,225,858101,302,0001,002,0002,269,184
8Nov 10, 2023 09:2112,329129,096,488100,326,0002,006,0002,269,184
9Nov 10, 2023 09:2112,383127,594,538100,783,0001,995,0002,375,680
10Nov 10, 2023 09:2113,411180,506,415111,307,45802,273,280
11Nov 10, 2023 09:2113,417173,926,495111,364,72002,285,568
12Nov 10, 2023 09:2113,422181,810,291111,402,22702,281,472