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 28, 2022 17:03Robert BurkeRobert BurkeScore: 8,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 17:037,95587,022,19064,030,0002,000,0002,428,928
2Dec 28, 2022 17:037,97087,576,35265,148,0001,002,0002,277,376
3Dec 28, 2022 17:037,97891,363,28664,214,0002,006,0002,277,376
4Dec 28, 2022 17:037,98388,071,66765,253,0001,003,0002,428,928
5Dec 28, 2022 17:037,98396,408,13765,259,0001,003,0002,277,376
6Dec 28, 2022 17:037,99088,446,35364,312,0002,009,0002,277,376
7Dec 28, 2022 17:038,00087,728,07666,399,00002,539,520
8Dec 28, 2022 17:038,00389,542,07566,422,00002,428,928
9Dec 28, 2022 17:038,00587,712,97665,439,0001,006,0002,428,928
10Dec 28, 2022 17:038,00787,766,66366,458,00002,277,376
11Dec 28, 2022 17:038,011134,672,02666,492,25802,179,072
12Dec 28, 2022 17:038,01890,134,51565,539,0001,008,0002,428,928
13Dec 28, 2022 17:038,023129,372,30166,594,93902,174,976
14Dec 28, 2022 17:038,023120,738,11966,590,39102,170,880
15Dec 28, 2022 17:038,02988,837,81865,645,000994,0002,277,376