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 29, 2024 10:26NoSIMD_C#NoSIMD_C#Score: 58,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 10:2658,270517,031,044482,646,000999,0002,273,280
2Nov 29, 2024 10:2658,271515,497,316481,650,0001,998,0002,269,184
3Nov 29, 2024 10:2658,276518,524,482481,694,0001,998,0002,273,280
4Nov 29, 2024 10:2658,281510,376,152481,731,0001,998,0002,265,088
5Nov 29, 2024 10:2658,288513,233,909481,792,0001,999,0002,273,280
6Nov 29, 2024 10:2658,297511,607,818481,862,0001,999,0002,273,280
7Nov 29, 2024 10:2658,297514,386,449480,864,0002,999,0002,273,280
8Nov 29, 2024 10:2658,300512,068,205481,895,0001,999,0002,273,280
9Nov 29, 2024 10:2658,318512,605,648482,043,0002,000,0002,519,040