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 12, 2024 12:18Leonid KorotkevichLeonid KorotkevichScore: 1,828,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 12:181,826,15315,188,611,17915,096,102,00060,972,0002,281,472
2Dec 12, 2024 12:181,826,26915,190,210,04615,093,061,00064,974,0002,285,568
3Dec 12, 2024 12:181,826,36015,193,101,16215,082,811,00075,973,0002,277,376
4Dec 12, 2024 12:181,827,48815,204,023,21415,091,186,00076,965,0002,277,376
5Dec 12, 2024 12:181,828,52615,206,257,34315,107,795,00068,971,0002,387,968
6Dec 12, 2024 12:181,828,99515,214,073,31115,104,692,00075,963,0002,285,568
7Dec 12, 2024 12:181,830,39515,222,633,80015,127,304,00064,971,0002,277,376
8Dec 12, 2024 12:181,830,95915,228,735,45815,125,994,00070,967,0002,277,376
9Dec 12, 2024 12:181,848,12515,368,820,71015,283,455,00055,979,0002,277,376