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 listMar 14, 2024 19:33Matt StuchlikMatt StuchlikScore: 29,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2024 19:3329,641280,444,350244,020,0002,000,0002,273,280
2Mar 14, 2024 19:3329,645268,563,963244,054,0002,000,0002,273,280
3Mar 14, 2024 19:3329,680267,107,464243,344,0003,004,0002,514,944
4Mar 14, 2024 19:3329,685270,955,746245,387,0001,001,0002,273,280
5Mar 14, 2024 19:3329,688271,348,537245,407,0001,001,0002,273,280
6Mar 14, 2024 19:3329,689268,990,263246,420,00002,273,280
7Mar 14, 2024 19:3329,704273,428,825245,538,0001,002,0002,519,040
8Mar 14, 2024 19:3329,724273,390,723245,712,000998,0002,273,280
9Mar 14, 2024 19:3329,728272,237,740243,730,0003,009,0002,273,280
10Mar 14, 2024 19:3329,876313,098,481247,966,91902,277,376
11Mar 14, 2024 19:3329,882306,584,735248,021,31102,273,280
12Mar 14, 2024 19:3329,885307,799,441248,048,02902,277,376