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 11:55ZOTTIGZOTTIGScore: 88,758Success
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 11:5588,403758,691,863664,770,00068,976,0002,519,040
2Nov 11, 2024 11:5588,545763,249,819663,930,00070,992,0002,510,848
3Nov 11, 2024 11:5588,595761,063,127655,413,00079,928,0002,482,176
4Nov 11, 2024 11:5588,747762,972,297666,636,00069,961,0002,478,080
5Nov 11, 2024 11:5588,758763,863,283662,723,00073,969,0002,531,328
6Nov 11, 2024 11:5588,999766,668,615669,723,00068,971,0002,543,616
7Nov 11, 2024 11:5589,343771,501,269662,597,00078,952,0002,535,424
8Nov 11, 2024 11:5589,547774,493,753667,316,00075,922,0002,535,424
9Nov 11, 2024 11:5589,714776,774,903669,667,00074,962,0002,535,424