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 listDec 28, 2022 20:39Alexander KimAlexander KimScore: 28,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 20:3928,370261,843,098232,465,0003,006,0002,412,544
2Dec 28, 2022 20:3928,378258,958,195234,538,0001,002,0002,404,352
3Dec 28, 2022 20:3928,385259,260,817234,593,0001,002,0002,416,640
4Dec 28, 2022 20:3928,393261,430,787230,670,0004,992,0002,506,752
5Dec 28, 2022 20:3928,402265,483,254234,735,000998,0002,412,544
6Dec 28, 2022 20:3928,406265,374,497233,770,0001,998,0002,527,232
7Dec 28, 2022 20:3928,406260,218,455232,769,0002,997,0002,531,328
8Dec 28, 2022 20:3928,407265,288,249234,779,000999,0002,318,336
9Dec 28, 2022 20:3928,445300,068,564236,090,03402,232,320
10Dec 28, 2022 20:3928,455293,058,620236,173,53602,228,224
11Dec 28, 2022 20:3928,459316,372,353236,212,66602,228,224
12Dec 28, 2022 20:3928,623269,438,998236,569,0001,002,0002,318,336