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 listJan 21, 2025 07:29NoSIMD_C#NoSIMD_C#Score: 78,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 07:2978,920684,151,160603,034,00052,003,0002,293,760
2Jan 21, 2025 07:2978,921683,243,711599,043,00056,004,0002,289,664
3Jan 21, 2025 07:2979,084682,795,545608,444,00047,956,0002,289,664