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 23, 2025 08:31NoSIMD_C#NoSIMD_C#Score: 64,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:3164,962567,004,114475,161,00064,021,0002,371,584
2Jan 23, 2025 08:3164,982561,017,573481,310,00058,037,0002,371,584
3Jan 23, 2025 08:3164,997567,520,766483,423,00056,049,0002,375,680