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 11, 2024 13:35zielajzielajScore: 6,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 13:356,13369,689,44148,911,0001,996,0002,535,424
2Nov 11, 2024 13:356,17075,695,49250,204,0001,004,0002,535,424
3Nov 11, 2024 13:356,19470,153,32551,411,00002,433,024
4Nov 11, 2024 13:356,96686,179,95456,820,000996,0002,269,184
5Nov 11, 2024 13:357,02083,750,20957,265,0001,004,0002,433,024
6Nov 11, 2024 13:357,18685,312,72659,640,00002,269,184