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 12, 2024 15:08Kirill AndriianovKirill AndriianovScore: 57,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 15:0857,102498,366,574472,946,000999,0002,486,272
2Nov 12, 2024 15:0857,103496,742,748472,952,000999,0002,527,232
3Nov 12, 2024 15:0857,104497,519,208470,967,0002,999,0002,531,328
4Nov 12, 2024 15:0857,110501,503,251473,015,0001,000,0002,486,272
5Nov 12, 2024 15:0857,123499,231,097473,122,0001,000,0002,527,232
6Nov 12, 2024 15:0857,125500,644,409473,135,0001,000,0002,531,328
7Nov 12, 2024 15:0857,131502,617,859474,187,00002,535,424
8Nov 12, 2024 15:0857,142501,991,995474,278,00002,531,328
9Nov 12, 2024 15:0857,191499,182,308473,687,000999,0002,486,272