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 listDec 16, 2024 09:35NoSIMD_C#NoSIMD_C#Score: 56,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2024 09:3556,573496,237,361467,556,0001,998,0002,285,568
2Dec 16, 2024 09:3556,580493,487,405468,613,000999,0002,519,040
3Dec 16, 2024 09:3556,585496,471,594467,658,0001,998,0002,285,568
4Dec 16, 2024 09:3556,588492,893,870468,679,0001,001,0002,396,160
5Dec 16, 2024 09:3556,590496,251,417467,695,0001,998,0002,269,184
6Dec 16, 2024 09:3556,595492,705,647468,736,000999,0002,273,280
7Dec 16, 2024 09:3556,597493,407,854467,755,0001,998,0002,285,568
8Dec 16, 2024 09:3556,617494,995,461467,920,0001,999,0002,285,568
9Dec 16, 2024 09:3556,624491,607,226466,978,0002,999,0002,285,568