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 listFeb 12, 2025 06:03NoSIMD_C#NoSIMD_C#Score: 1,228,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 06:031,226,98210,223,659,07410,103,990,00079,960,0002,269,184
2Feb 12, 2025 06:031,228,26510,228,204,62310,124,639,00069,962,0002,269,184
3Feb 12, 2025 06:031,232,71310,260,400,85810,173,550,00057,968,0002,269,184