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 3, 2024 12:44zielajzielajScore: 16,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2024 12:4416,853159,129,611138,878,000999,0002,514,944
2Nov 3, 2024 12:4416,856162,691,017138,907,000999,0002,273,280
3Nov 3, 2024 12:4416,859164,064,825138,928,000999,0002,535,424
4Nov 3, 2024 12:4416,860161,140,618138,940,000999,0002,433,024
5Nov 3, 2024 12:4416,865161,384,866138,983,000999,0002,535,424
6Nov 3, 2024 12:4416,869160,556,474138,011,0002,000,0002,514,944
7Nov 3, 2024 12:4416,883159,777,491138,124,0002,001,0002,514,944
8Nov 3, 2024 12:4416,887162,678,670139,158,0001,001,0002,433,024
9Nov 3, 2024 12:4416,891166,826,733139,191,0001,001,0002,273,280