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 18, 2024 11:06moonnoonmoonnoonScore: 1,831,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 18, 2024 11:061,825,57115,187,741,38815,068,275,00083,962,0002,260,992
2Dec 18, 2024 11:061,826,29215,195,134,57215,087,259,00070,963,0002,277,376
3Dec 18, 2024 11:061,826,54315,195,743,90415,100,337,00059,973,0002,277,376
4Dec 18, 2024 11:061,826,61215,199,407,61015,080,910,00079,967,0002,289,664
5Dec 18, 2024 11:061,831,96215,238,199,62715,151,309,00053,976,0002,277,376
6Dec 18, 2024 11:061,832,32015,246,558,20715,137,290,00070,968,0002,277,376
7Dec 18, 2024 11:061,860,49715,477,903,07915,373,152,00068,969,0002,277,376
8Dec 18, 2024 11:061,870,91815,556,441,60215,455,652,00072,965,0002,277,376
9Dec 18, 2024 11:061,957,13316,285,533,26016,170,239,00073,969,0002,277,376