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 listNov 23, 2024 14:14E SequeiraE SequeiraScore: 13,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:1213,372137,480,360108,991,0001,999,0002,289,664
2Nov 23, 2024 14:1213,375135,918,043110,015,0001,000,0002,482,176
3Nov 23, 2024 14:1213,377137,381,540109,025,0002,000,0002,281,472
4Nov 23, 2024 14:1213,381137,024,729109,065,0002,001,0002,289,664
5Nov 23, 2024 14:1213,383141,788,654109,078,0002,001,0002,289,664
6Nov 23, 2024 14:1413,390138,369,335109,133,0002,002,0002,469,888
7Nov 23, 2024 14:1213,392138,769,554110,155,0001,001,0002,478,080
8Nov 23, 2024 14:1413,396138,721,278109,183,0002,003,0002,289,664
9Nov 23, 2024 14:1213,399137,561,512109,209,0002,003,0002,289,664
10Nov 23, 2024 14:1213,401133,868,399109,225,0002,004,0002,289,664
11Nov 23, 2024 14:1413,403135,143,046109,239,0002,004,0002,289,664
12Nov 23, 2024 14:1213,408134,819,788109,285,0002,005,0002,469,888