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 6, 2024 12:56zielajzielajScore: 11,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 12:5611,904126,527,02697,803,000997,0002,424,832
2Nov 6, 2024 12:5611,906120,578,68798,821,00002,510,848
3Nov 6, 2024 12:5611,909126,517,64998,842,00002,535,424
4Nov 6, 2024 12:5611,911129,624,17296,865,0001,997,0002,433,024
5Nov 6, 2024 12:5611,915120,704,90796,894,0001,997,0002,433,024
6Nov 6, 2024 12:5611,919122,196,31396,933,0001,998,0002,428,928