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 13, 2024 06:31Alexander KosachevAlexander KosachevScore: 53,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 06:3153,948470,977,479445,767,0001,998,0002,527,232
2Nov 13, 2024 06:3153,953471,881,957447,807,00002,531,328
3Nov 13, 2024 06:3153,962471,056,576445,884,0001,999,0002,531,328
4Nov 13, 2024 06:3153,963472,784,024446,892,000999,0002,531,328
5Nov 13, 2024 06:3153,984472,974,535447,065,0001,000,0002,482,176
6Nov 13, 2024 06:3153,984473,408,637448,071,00002,486,272
7Nov 13, 2024 06:3153,991469,970,809448,124,00002,531,328
8Nov 13, 2024 06:3154,010465,722,920448,284,00002,531,328
9Nov 13, 2024 06:3154,037477,948,953447,506,000998,0002,535,424