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 15, 2024 05:09NoSIMD_C#NoSIMD_C#Score: 67,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 05:0967,159584,666,284498,379,00059,044,0002,293,760
2Nov 15, 2024 05:0967,227588,523,338499,989,00057,998,0002,289,664
3Nov 15, 2024 05:0967,257583,968,893500,212,00058,024,0002,539,520
4Nov 15, 2024 05:0967,276590,039,688489,464,00068,924,0002,461,696
5Nov 15, 2024 05:0967,284585,995,211493,520,00064,936,0002,539,520
6Nov 15, 2024 05:0967,305590,918,848492,678,00065,956,0002,539,520
7Nov 15, 2024 05:0967,356586,680,690498,052,00061,006,0002,445,312
8Nov 15, 2024 05:0967,438588,330,799500,765,00058,972,0002,465,792
9Nov 15, 2024 05:0967,493591,629,908491,165,00069,023,0002,473,984