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 16, 2024 17:29NoSIMD_C#NoSIMD_C#Score: 96,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 17:2996,884831,049,772751,130,00053,009,0002,465,792
2Nov 16, 2024 17:2996,909832,174,433750,321,00054,023,0002,539,520
3Nov 16, 2024 17:2996,954832,040,408748,738,00055,980,0002,445,312