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 23, 2023 15:10Alexander KrivolapovAlexander KrivolapovScore: 20,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2023 15:1019,978234,081,610165,816,90602,203,648
2Dec 23, 2023 15:1019,993224,952,843165,942,02802,211,840
3Dec 23, 2023 15:1020,051226,521,866166,423,40402,203,648
4Dec 23, 2023 15:1020,265194,623,632166,195,0002,002,0002,400,256
5Dec 23, 2023 15:1020,279195,645,784167,318,0001,001,0002,342,912
6Dec 23, 2023 15:1020,282197,696,363167,338,0001,002,0002,347,008
7Dec 23, 2023 15:1020,292192,490,490168,422,00002,502,656
8Dec 23, 2023 15:1020,306200,221,758167,534,0001,003,0002,355,200
9Dec 23, 2023 15:1020,306195,808,603168,537,00002,347,008
10Dec 23, 2023 15:1020,322197,337,348165,682,0002,994,0002,363,392
11Dec 23, 2023 15:1020,328196,991,476167,724,000998,0002,371,584
12Dec 23, 2023 15:1020,329191,443,897165,738,0002,995,0002,400,256