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 listSep 11, 2024 12:04Dmitrii KravchenkoDmitrii KravchenkoScore: 355,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2024 12:04355,5472,981,652,6372,875,066,00075,975,0002,289,664
2Sep 11, 2024 12:04355,6012,976,394,4892,868,530,00082,957,0002,285,568
3Sep 11, 2024 12:04355,6632,980,165,4872,878,027,00073,975,0002,490,368
4Sep 11, 2024 12:04355,7532,980,465,3542,865,785,00086,963,0002,482,176
5Sep 11, 2024 12:04355,8592,977,995,9192,878,665,00074,965,0002,285,568
6Sep 11, 2024 12:04355,9392,986,358,3312,878,339,00075,956,0002,490,368
7Sep 11, 2024 12:04359,2073,006,045,0522,892,464,00088,952,0002,285,568
8Sep 11, 2024 12:04361,8793,033,164,1682,915,639,00087,958,0002,285,568
9Sep 11, 2024 12:04364,2063,049,341,1172,942,937,00079,971,0002,285,568