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 3, 2025 05:01NoSIMD_C#NoSIMD_C#Score: 50,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:0150,038435,850,726415,314,00002,269,184
2Feb 3, 2025 05:0150,055443,258,342415,459,00002,437,120
3Feb 3, 2025 05:0150,056438,047,283413,465,0001,997,0002,531,328
4Feb 3, 2025 05:0150,058440,928,383415,484,00002,433,024
5Feb 3, 2025 05:0150,081442,388,839415,673,00002,531,328
6Feb 3, 2025 05:0150,082439,962,797414,681,000999,0002,531,328
7Feb 3, 2025 05:0150,083442,648,306414,694,000999,0002,437,120
8Feb 3, 2025 05:0150,102442,142,406414,850,000999,0002,269,184
9Feb 3, 2025 05:0150,153442,055,957416,273,00002,531,328