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 11, 2024 02:38Joad NacerJoad NacerScore: 4,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 02:384,48263,772,47734,183,0003,016,0002,506,752
2Oct 11, 2024 02:384,48757,693,43334,224,0003,019,0002,510,848
3Oct 11, 2024 02:384,49261,523,22735,268,0002,015,0002,334,720
4Oct 11, 2024 13:284,49459,847,21435,282,0002,016,0002,363,392
5Oct 11, 2024 13:284,49959,608,51036,333,0001,009,0002,334,720
6Oct 11, 2024 13:284,50564,250,20934,360,0003,031,0002,334,720
7Oct 11, 2024 02:384,56658,046,55134,904,0002,991,0002,531,328
8Oct 11, 2024 13:284,57062,747,31236,936,000998,0002,400,256
9Oct 11, 2024 13:284,57263,038,33535,954,0001,997,0002,510,848
10Oct 11, 2024 02:384,57560,790,64735,977,0001,998,0002,510,848
11Oct 11, 2024 02:384,57768,462,45636,988,000999,0002,494,464
12Oct 11, 2024 13:284,58562,913,61835,052,0003,004,0002,330,624