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 listSep 18, 2024 08:12Pavel SamyginPavel SamyginScore: 1,824,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2024 08:121,821,40615,153,269,77715,039,700,00077,967,0002,281,472
2Sep 18, 2024 08:121,822,65315,164,662,06315,042,064,00085,960,0002,293,760
3Sep 18, 2024 08:121,822,91415,159,963,08615,041,229,00088,959,0002,281,472
4Sep 18, 2024 08:121,823,23815,163,422,40915,066,903,00065,973,0002,281,472
5Sep 18, 2024 08:121,824,28315,171,118,61915,061,582,00079,965,0002,293,760
6Sep 18, 2024 08:121,825,37215,183,017,76315,079,620,00070,965,0002,289,664
7Sep 18, 2024 08:121,825,38115,181,149,18115,075,692,00074,968,0002,289,664
8Sep 18, 2024 08:121,825,92115,188,618,87915,096,169,00058,977,0002,281,472
9Sep 18, 2024 08:121,826,27615,187,091,10215,107,109,00050,980,0002,281,472