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 24, 2024 13:19bonekeEbonekeEScore: 1,826,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 13:191,825,84515,187,725,76715,102,536,00051,977,0002,277,376
2Dec 24, 2024 13:191,826,12515,187,537,52415,082,871,00073,965,0002,277,376
3Dec 24, 2024 13:191,826,21115,189,532,13615,093,585,00063,968,0002,277,376
4Dec 24, 2024 13:191,826,24115,188,298,78115,101,821,00055,977,0002,277,376
5Dec 24, 2024 13:191,826,33515,195,081,09915,075,609,00082,970,0002,285,568
6Dec 24, 2024 13:191,826,46615,189,129,36615,105,688,00053,977,0002,277,376
7Dec 24, 2024 13:191,826,89015,192,119,35815,100,217,00062,971,0002,277,376
8Dec 24, 2024 13:191,829,54415,219,134,55315,116,248,00068,969,0002,277,376
9Dec 24, 2024 13:191,918,44015,956,130,13515,858,075,00064,975,0002,285,568