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 listMar 3, 2024 04:33matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2024 04:3300000Error: expected "53681553997149811 ", got "298.378509ms 499999999500000000"
2Mar 3, 2024 04:3300000Error: expected "53688531119181114 ", got "309.093101ms 499999999500000000"
3Mar 3, 2024 04:3900000Error: expected "53683659646410792 ", got "319.782613ms 499999999500000000"
4Mar 3, 2024 05:1500000Error: expected "53691436213738005 ", got "331.629148ms 499999999500000000"
5Mar 3, 2024 05:1800000Error: expected "53684945080262992 ", got "318.334045ms 499999999500000000"
6Mar 3, 2024 05:2300000Error: expected "53691587041354304 ", got "323.183856ms 499999999500000000"