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:41E SequeiraE SequeiraScore: 13,356Success
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:4113,305133,420,574109,426,0001,003,0002,478,080
2Nov 23, 2024 14:4113,330141,386,793109,632,0001,005,0002,289,664
3Nov 23, 2024 14:4113,350145,537,488108,809,0001,996,0002,473,984
4Nov 23, 2024 14:4113,350134,086,458108,811,0001,996,0002,289,664
5Nov 23, 2024 14:4113,356137,745,905108,861,0001,997,0002,289,664
6Nov 23, 2024 14:4113,357138,245,265108,862,0001,997,0002,289,664
7Nov 23, 2024 14:4113,358136,001,537109,871,000998,0002,289,664
8Nov 23, 2024 14:4113,359135,260,877108,885,0001,997,0002,473,984
9Nov 23, 2024 14:4113,359136,727,036108,886,0001,997,0002,289,664