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 13:46E SequeiraE SequeiraScore: 19,071Success
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 13:4619,039179,713,668156,027,0002,000,0002,289,664
2Nov 23, 2024 13:4619,058182,780,244156,179,0002,002,0002,289,664
3Nov 23, 2024 13:4619,066180,524,517156,247,0002,003,0002,334,720
4Nov 23, 2024 13:4619,070180,685,230157,278,0001,001,0002,289,664
5Nov 23, 2024 13:4619,071186,256,194156,284,0002,003,0002,289,664
6Nov 23, 2024 13:4619,073180,675,042156,307,0002,003,0002,289,664
7Nov 23, 2024 13:4619,091181,395,004157,457,0001,002,0002,281,472
8Nov 23, 2024 13:4619,093185,315,911157,468,0001,002,0002,289,664
9Nov 23, 2024 13:4619,094184,250,760157,480,0001,003,0002,281,472