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 listApr 26, 2024 21:42Joad NacerJoad NacerScore: 28,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2024 21:4227,781298,375,868230,578,38602,281,472
2Apr 26, 2024 21:4228,211257,489,995232,153,0002,001,0002,285,568
3Apr 26, 2024 21:4228,223256,871,701232,247,0002,002,0002,285,568
4Apr 26, 2024 21:4228,224263,606,345232,261,0002,002,0002,367,488
5Apr 26, 2024 21:4228,228258,980,415232,290,0002,002,0002,285,568
6Apr 26, 2024 21:4228,240256,984,458233,394,0001,001,0002,277,376
7Apr 26, 2024 21:4228,250260,632,012233,475,0001,002,0002,510,848
8Apr 26, 2024 21:4228,252266,770,971233,487,0001,002,0002,285,568
9Apr 26, 2024 21:4228,264264,504,154233,593,0001,002,0002,527,232
10Apr 26, 2024 21:4228,292306,724,574234,826,47302,285,568
11Apr 26, 2024 21:4228,717260,628,973237,351,0001,001,0002,285,568
12Apr 26, 2024 21:4230,115309,026,077249,954,87002,293,760