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 28, 2025 10:13NoSIMD_C#NoSIMD_C#Score: 64,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2025 10:1364,705561,687,529475,047,00062,006,0002,482,176
2Mar 28, 2025 10:1364,880565,736,451491,546,00046,956,0002,469,888
3Mar 28, 2025 10:1365,042564,302,941479,868,00059,983,0002,289,664