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 13, 2023 04:12sliceteamsliceteamScore: 12,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2023 04:1212,179129,405,280100,082,0001,000,0002,273,280
2Nov 13, 2023 04:1212,184129,135,83199,124,0002,002,0002,273,280
3Nov 13, 2023 04:1212,185121,682,32799,136,0002,002,0002,457,600
4Nov 13, 2023 04:1212,192125,348,14399,193,0002,003,0002,273,280
5Nov 13, 2023 04:1212,193124,142,73399,195,0002,003,0002,273,280
6Nov 13, 2023 04:1212,193123,585,91599,200,0002,004,0002,273,280
7Nov 13, 2023 04:1212,193124,009,843100,204,0001,002,0002,273,280
8Nov 13, 2023 04:1212,204123,450,252100,290,0001,002,0002,273,280
9Nov 13, 2023 04:1212,204122,348,14099,287,0002,005,0002,465,792
10Nov 13, 2023 04:1212,345164,381,360102,461,38902,174,976
11Nov 13, 2023 04:1212,389173,409,066102,831,61902,293,760
12Nov 13, 2023 04:1212,928180,326,159107,304,32402,301,952