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 listMar 6, 2025 06:11NoSIMD_C#NoSIMD_C#Score: 50,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2025 06:1150,082438,852,845414,680,000999,0002,269,184
2Mar 6, 2025 06:1150,087435,533,360414,723,000999,0002,531,328
3Mar 6, 2025 06:1150,107433,992,984413,889,0001,999,0002,433,024