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 11, 2024 18:53ndbnndbnScore: 71,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 18:5370,916618,328,940587,600,000999,0002,478,080
2Nov 11, 2024 18:5370,929607,972,784586,713,0001,999,0002,535,424
3Nov 11, 2024 18:5370,936614,967,222586,772,0001,999,0002,535,424
4Nov 11, 2024 18:5370,940616,299,211586,802,0001,999,0002,535,424
5Nov 11, 2024 18:5371,008618,264,345588,368,0001,000,0002,469,888
6Nov 11, 2024 18:5372,666621,290,838602,128,0001,000,0002,465,792
7Nov 11, 2024 18:5372,684625,162,303602,281,0001,000,0002,469,888
8Nov 11, 2024 18:5372,724628,243,197601,614,0001,998,0002,478,080
9Nov 11, 2024 18:5372,764631,212,457602,946,000999,0002,469,888