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 15:55Dmitrii KravchenkoDmitrii KravchenkoScore: 66,160Success
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 15:5566,075579,463,693483,371,00065,050,000188,416
2Sep 11, 2024 15:5566,100579,783,446498,663,00049,966,000311,296
3Sep 11, 2024 15:5566,119577,691,980489,813,00058,977,000188,416
4Sep 11, 2024 15:5566,147578,884,269489,016,00060,002,0002,404,352
5Sep 11, 2024 15:5566,160575,459,123500,116,00049,011,0002,289,664
6Sep 11, 2024 15:5566,169579,684,106494,184,00055,020,000311,296
7Sep 11, 2024 15:5566,179572,127,048483,249,00066,034,000188,416
8Sep 11, 2024 15:5566,210580,996,687488,593,00060,949,0002,510,848
9Sep 11, 2024 15:5566,221575,082,600483,679,00065,956,000323,584