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 31, 2024 22:19howspookyhowspookyScore: 1,880,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2024 22:191,878,62115,622,123,60615,504,593,00087,963,0002,281,472
2Oct 31, 2024 22:191,880,26715,639,428,02315,558,233,00047,979,0002,281,472
3Oct 31, 2024 22:191,880,32215,634,734,10215,546,701,00059,975,0002,293,760
4Oct 31, 2024 22:191,880,34515,642,031,25315,549,894,00056,973,0002,289,664
5Oct 31, 2024 22:191,880,53515,646,184,97315,541,468,00066,971,0002,281,472
6Oct 31, 2024 22:191,880,58415,641,741,75415,534,879,00073,970,0002,281,472
7Oct 31, 2024 22:191,882,73215,666,440,29915,555,706,00070,966,0002,523,136
8Oct 31, 2024 22:191,884,54915,680,440,97315,563,793,00077,963,0002,281,472
9Oct 31, 2024 22:191,922,27815,985,899,06915,894,933,00059,977,0002,293,760