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 10, 2024 19:34Serge SmirnovSerge SmirnovScore: 28,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 19:3428,851265,514,552238,461,0001,001,0002,535,424
2Nov 10, 2024 19:3428,852262,914,815239,473,00002,535,424
3Nov 10, 2024 19:3428,856271,756,603238,500,0001,002,0002,293,760
4Nov 10, 2024 19:3428,857266,496,338237,522,0001,995,0002,531,328
5Nov 10, 2024 19:3428,860265,499,379238,532,0001,002,0002,531,328
6Nov 10, 2024 19:3428,870268,562,302237,628,0001,996,0002,293,760
7Nov 10, 2024 19:3428,881266,612,693238,714,000998,0002,351,104
8Nov 10, 2024 19:3428,881276,613,182238,718,000998,0002,514,944
9Nov 10, 2024 19:3428,886272,863,997237,754,0001,997,0002,527,232