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 15:52NoSIMD_C#NoSIMD_C#Score: 83,661Success
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 15:5283,610725,261,225631,967,00061,996,0002,523,136
2Nov 6, 2024 15:5283,631718,011,014630,122,00064,012,0002,289,664
3Nov 6, 2024 15:5283,633718,048,196641,139,00053,011,0002,301,952
4Nov 6, 2024 15:5283,640719,220,721636,197,00058,017,0002,293,760
5Nov 6, 2024 15:5283,661721,411,909658,365,00036,019,0002,301,952
6Nov 6, 2024 15:5283,678724,595,298624,575,00069,952,0002,289,664
7Nov 6, 2024 15:5283,705718,964,404640,774,00053,980,0002,297,856
8Nov 6, 2024 15:5283,710727,028,403629,811,00064,980,0002,301,952
9Nov 6, 2024 15:5283,727721,240,428624,939,00069,993,0002,293,760