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 listJul 29, 2022 22:41Yuriy LyfenkoYuriy LyfenkoScore: 14,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2022 22:4114,593144,201,893119,119,0002,002,0002,465,792
2Jul 29, 2022 22:4114,595148,188,939120,134,0001,001,0002,363,392
3Jul 29, 2022 22:4114,597142,293,398119,153,0002,002,0002,461,696
4Jul 29, 2022 22:4114,597143,630,403119,156,0002,002,0002,412,544
5Jul 29, 2022 22:4114,601140,468,382119,184,0002,003,0002,424,832
6Jul 29, 2022 22:4114,605142,952,086119,221,0002,003,0002,310,144
7Jul 29, 2022 22:4114,632142,110,644119,437,0002,007,0002,387,968
8Jul 29, 2022 22:4114,649147,071,588120,585,0001,004,0002,387,968
9Jul 29, 2022 22:4114,682149,141,001118,867,0002,996,0002,400,256
10Jul 29, 2022 22:4115,101184,217,954125,340,94102,252,800
11Jul 29, 2022 22:4115,117176,567,773125,471,84302,244,608
12Jul 29, 2022 22:4115,147177,972,050125,723,20902,306,048