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 7, 2024 05:06NoSIMD_C#NoSIMD_C#Score: 67,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 7, 2024 05:0667,254580,822,040505,192,00053,020,0002,469,888
2Dec 7, 2024 05:0667,267587,118,586509,287,00049,027,0002,535,424
3Dec 7, 2024 05:0667,267581,011,588509,290,00049,027,0002,465,792